Algorithm Theory - SWAT 2004

DOI10.1007/B98413MaRDI QIDQ5315385zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
• Improved Approximation for Single-Sink Buy-at-Bulk
• Approximation algorithms for nonuniform buy-at-bulk network design
• Approximation algorithms for node-weighted buy-at-bulk network design
• Approximating directed buy-at-bulk network design

Cited in

(20)

• Approximation algorithms for connected facility location problems
• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
• Connected facility location via random facility sampling and core detouring
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
• Approximating the single-sink link-installation problem in network design
• One tree suffices: a simultaneous \(O(1)\)-approximation for single-sink buy-at-bulk
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• Approximation algorithms for nonuniform buy-at-bulk network design
• Approximating directed buy-at-bulk network design
• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
• Single-sink network design with vertex connectivity requirements
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design
• LP-based approximation algorithms for facility location in buy-at-bulk network design
• scientific article; zbMATH DE number 1757956 (Why is no real title available?)
• Approximation algorithms for a combined facility location buy-at-bulk network design problem
• 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
• Improved Approximation for Single-Sink Buy-at-Bulk
• LP-based approximation algorithms for facility location in buy-at-bulk network design
• On the approximation of the generalized capacitated tree-routing problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315385)