Algorithm Theory - SWAT 2004

DOI10.1007/b98413zbMath1095.90517OpenAlexW2615963353MaRDI QIDQ5315385

Raja Jothi, Balaji Raghavachari

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (12)

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design ⋮ Combinatorial approximation algorithms for buy-at-bulk connected facility location problems ⋮ Approximation Algorithms for Buy-at-Bulk Geometric Network Design ⋮ Connected facility location via random facility sampling and core detouring ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ LP-based approximation algorithms for facility location in buy-at-bulk network design ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem ⋮ A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ Approximation algorithms for connected facility location problems ⋮ Improved approximation algorithms for the single-sink buy-at-bulk network design problems

This page was built for publication: Algorithm Theory - SWAT 2004