Publication:2934722
From MaRDI portal
zbMath1302.90028MaRDI QIDQ2934722
Mohammad R. Salavatipour, Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz
Publication date: 18 December 2014
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68M10: Network design and communication in computer systems
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
05C21: Flows in graphs
Related Items
Online Buy-at-Bulk Network Design, Competitive Cost Sharing with Economies of Scale, Approximating Steiner Networks with Node Weights, Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph, Approximation algorithms for orienting mixed graphs, Approximating \(k\)-generalized connectivity via collapsing HSTs, Competitive cost sharing with economies of scale, Approximating some network design problems with node costs, Approximability of Capacitated Network Design, Oblivious Buy-at-Bulk in Planar Graphs, Approximation Algorithms for Buy-at-Bulk Geometric Network Design