Back to Search
Start Over
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.
- Source :
-
Algorithmica . Mar2019, Vol. 81 Issue 3, p1075-1095. 21p. - Publication Year :
- 2019
-
Abstract
- We study problems that integrate buy-at-bulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermore, capacities of the edges can be purchased in discrete units from K different cable types with costs that satisfy economies of scale. We extend the linear programming framework of Talwar (IPCO 2002) for the single-source buy-at-bulk problem to these variants and prove integrality gap upper bounds for both facility location and connected facility location buy-at-bulk problems. For the unconnected variant we prove an integrality gap bound of O(K), and for the connected version, we get the first LP-based bound of O(1). [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01784617
- Volume :
- 81
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Algorithmica
- Publication Type :
- Academic Journal
- Accession number :
- 134970059
- Full Text :
- https://doi.org/10.1007/s00453-018-0458-x