scientific article; zbMATH DE number 1757956

MaRDI QIDQ4537744zbMATH OpenFDO

Authors Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810170

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2086941
• Improved Approximation for Single-Sink Buy-at-Bulk
• Algorithm Theory - SWAT 2004
• LP-based approximation algorithms for facility location in buy-at-bulk network design
• Improved approximation algorithms for the single-sink buy-at-bulk network design problems

Cited in

(12)

• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
• 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 2086941 (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
• Improved Approximation for Single-Sink Buy-at-Bulk
• Deterministic sampling algorithms for 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 Q4537744)