Approximation algorithms for multicommodity facility location problems

DOI10.1137/080732857MaRDI QIDQ5392908zbMATH OpenOpenAlexFDO

Authors R. Ravi, Amitabh Sinha

Publication date 15 April 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/40ab8388ba257eac0be01580d196be64c6a73814

zbMATH Keywords

approximation algorithmfacility locationfractional \(k\)-set cover

Mathematics Subject Classification ID

Approximation algorithms (68W25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Recommendations

• Multicommodity facility location
• Non-metric Multicommodity and Multilevel Facility Location
• scientific article; zbMATH DE number 1559542
• Improved approximation algorithms for multilevel facility location problems
• scientific article; zbMATH DE number 1187151

Cited in

(10)

• The online multicommodity connected facility location problem
• Approximation of the competitive facility location problem with MIPs
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• scientific article; zbMATH DE number 3848936 (Why is no real title available?)
• Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
• Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
• Multicommodity facility location under group Steiner access cost
• Non-metric Multicommodity and Multilevel Facility Location
• Multicommodity facility location
• A new approximation algorithm for the multilevel facility location problem

This page was built for publication: Approximation algorithms for multicommodity facility location problems

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