Publication:2921762
From MaRDI portal
zbMath1297.68019MaRDI QIDQ2921762
Anupam Gupta, Joseph (Seffi) Naor, Julia Chuzhoy, Amitabh Sinha
Publication date: 13 October 2014
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
The Priority k-Median Problem, Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph, Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees, Approximability of capacitated network design, Approximability of Capacitated Network Design, On Capacitated Set Cover Problems, Online Priority Steiner Tree Problems