scientific article; zbMATH DE number 2086941

MaRDI QIDQ4737546zbMATH OpenFDO

Authors Kunal Talwar

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370475.htm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 1757956
• Improved Approximation for Single-Sink Buy-at-Bulk
• A constant factor approximation for the single sink edge installation problem
• A constant factor approximation for the single sink edge installation problems
• LP-based approximation algorithms for facility location in buy-at-bulk network design

Cited in

(22)

• Deterministic sampling algorithms for network design
• Oblivious buy-at-bulk in planar graphs
• Online Buy-at-Bulk Network Design
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
• Exact approaches for designing multifacility buy-at-bulk networks
• Approximability of unsplittable shortest path routing problems
• scientific article; zbMATH DE number 1757956 (Why is no real title available?)
• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
• A constant factor approximation for the single sink edge installation problems
• Traffic-redundancy aware network design
• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
• Two-level hub Steiner trees
• A constant factor approximation for the single sink edge installation problem
• Group parking permit problems
• Approximation algorithms for a combined facility location buy-at-bulk network design problem
• Connected facility location via random facility sampling and core detouring
• From cost sharing mechanisms to online selection problems
• An improved approximation algorithm for the uniform cost-distance Steiner tree problem
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design
• LP-based approximation algorithms for facility location in buy-at-bulk network design
• LP-based approximation algorithms for facility location in buy-at-bulk network design

This page was built for publication:

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