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 Algorithmica https://doi.org/10.1007/s00453-018-0458-x LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design 1 2 Zachary Friggstad · Mohsen Rezapour · 1 3 Mohammad R. Salavatipour · Jose A. Soto Received: 17 December 2016 / Accepted: 15 May 2018 © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract We study problems that integrate buy-at-bulk network design into the classi- cal (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. Further- more, 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 con- nected 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). A preliminary version of this paper appeared in the Proceedings of the 14th International Symposium on Algorithms and Data Structures (WADS) [4]. Z. Friggstad: Supported by NSERC and http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Algorithmica Springer Journals

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design

Loading next page...
 
/lp/springer_journal/lp-based-approximation-algorithms-for-facility-location-in-buy-at-bulk-xYyo7CAL0e
Publisher
Springer US
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Computer Science; Algorithm Analysis and Problem Complexity; Theory of Computation; Mathematics of Computing; Algorithms; Computer Systems Organization and Communication Networks; Data Structures, Cryptology and Information Theory
ISSN
0178-4617
eISSN
1432-0541
D.O.I.
10.1007/s00453-018-0458-x
Publisher site
See Article on Publisher Site

Abstract

Algorithmica https://doi.org/10.1007/s00453-018-0458-x LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design 1 2 Zachary Friggstad · Mohsen Rezapour · 1 3 Mohammad R. Salavatipour · Jose A. Soto Received: 17 December 2016 / Accepted: 15 May 2018 © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract We study problems that integrate buy-at-bulk network design into the classi- cal (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. Further- more, 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 con- nected 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). A preliminary version of this paper appeared in the Proceedings of the 14th International Symposium on Algorithms and Data Structures (WADS) [4]. Z. Friggstad: Supported by NSERC and

Journal

AlgorithmicaSpringer Journals

Published: May 30, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off