A 6.55 factor primal-dual approximation algorithm for the connected facility location problem

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

Journal of Combinatorial Optimization, 2009, vol. 18, issue 3, No 3, 258-271

Abstract: Abstract In the connected facility location (ConFL) problem, we are given a graph G=(V,E) with nonnegative edge cost c e on the edges, a set of facilities ℱ⊆V, a set of demands (i.e., clients) $\mathcal{D}\subseteq V$ , and a parameter M≥1. Each facility i has a nonnegative opening cost f i and each client j has d j units of demand. Our objective is to open some facilities, say F⊆ℱ, assign each demand j to some open facility i(j)∈F and connect all open facilities using a Steiner tree T such that the total cost, which is $\sum_{i\in F}f_{i}+\sum_{j\in \mathcal{D}}d_{j}c_{i(j)j}+M\sum_{e\in T}c_{e}$ , is minimized. We present a primal-dual 6.55-approximation algorithm for the ConFL problem which improves the previous primal-dual 8.55-approximation algorithm given by Swamy and Kumar (Algorithmica 40:245–269, 2004).

Keywords: Approximation algorithms; Primal-dual algorithms; Facility location problems; Greedy algorithm (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9227-8 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:18:y:2009:i:3:d:10.1007_s10878-009-9227-8

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

DOI: 10.1007/s10878-009-9227-8

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 ().