Approximation algorithms for connected facility location problems

Mohammad Khairul Hasan (), Hyunwoo Jung () and Kyung-Yong Chwa ()
Additional contact information
Mohammad Khairul Hasan: Korea Advanced Institute of Science and Technology
Hyunwoo Jung: Korea Advanced Institute of Science and Technology
Kyung-Yong Chwa: Korea Advanced Institute of Science and Technology

Journal of Combinatorial Optimization, 2008, vol. 16, issue 2, No 6, 155-172

Abstract: Abstract We study Connected Facility Location problems. We are given a connected graph G=(V,E) with nonnegative edge cost c e for each edge e∈E, a set of clients D⊆V such that each client j∈D has positive demand d j and a set of facilities F⊆V each has nonnegative opening cost f i and capacity to serve all client demands. The objective is to open a subset of facilities, say $\hat{F}$ , to assign each client j∈D to exactly one open facility i(j) and to connect all open facilities by a Steiner tree T such that the cost $\sum_{i\in \hat{F}}f_{i}+\sum_{j\in D}d_{j}c_{i(j)j}+M\sum_{e\in T}c_{e}$ is minimized for a given input parameter M≥1. We propose a LP-rounding based 8.29 approximation algorithm which improves the previous bound 8.55 (Swamy and Kumar in Algorithmica, 40:245–269, 2004). We also consider the problem when opening cost of all facilities are equal. In this case we give a 7.0 approximation algorithm.

Keywords: Approximation algorithms; Integer programming; LP-rounding; Connected facility location; Steiner tree (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9130-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:16:y:2008:i:2:d:10.1007_s10878-007-9130-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9130-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().