On non-uniform multicommodity buy-at-bulk network design
From MaRDI portal
Publication:3581390
DOI10.1145/1060590.1060617zbMath1192.68876OpenAlexW2059149798MaRDI QIDQ3581390
Adriana Karagiozova, Moses Charikar
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060617
Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
Minimum-Cost Network Design with (Dis)economies of Scale ⋮ Online Buy-at-Bulk Network Design ⋮ Online covering with \(\ell_q\)-norm objectives and applications to network design ⋮ Approximating some network design problems with node costs ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design ⋮ Approximability of unsplittable shortest path routing problems ⋮ Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
This page was built for publication: On non-uniform multicommodity buy-at-bulk network design
