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

@article{Jung2009A6F,
title={A 6.55 factor primal-dual approximation algorithm for the connected facility location problem},
author={Hyunwoo Jung and Mohammad Khairul Hasan and Kyung-Yong Chwa},
journal={J. Comb. Optim.},
year={2009},
volume={18},
pages={258-271}
}
In the connected facility location (ConFL) problem, we are given a graph G = (V ,E) with nonnegative edge cost ce on the edges, a set of facilities F ⊆ V , a set of demands (i.e., clients) D ⊆ V , and a parameter M ≥ 1. Each facility i has a nonnegative opening cost fi and each client j has dj units of demand. Our objective is to open some facilities, say F ⊆ 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… CONTINUE READING

#### Citations

##### Publications citing this paper.
Showing 1-4 of 4 extracted citations

## Fair Caching Algorithms for Peer Data Sharing in Pervasive Edge Computing Environments

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) • 2017
View 7 Excerpts
Highly Influenced

## A Randomized $$\mathrm {O}(\log n)$$ O ( log n ) -Competitive Algorithm for the Online Connected Facility Location Problem

Algorithmica • 2016
View 1 Excerpt

SWAT • 2016

## A Randomized O ( log n )-Competitive Algorithm for the Online Connected Facility Location Problem

#### References

##### Publications referenced by this paper.
Showing 1-10 of 19 references

## Approximating connected facility location problems via random facility sampling and core detouring

SODA • 2008
View 4 Excerpts
Highly Influenced

## An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

APPROX-RANDOM • 2007
View 7 Excerpts
Highly Influenced

## Primal-Dual Algorithms for Connected Facility Location Problems

APPROX • 2002
View 20 Excerpts
Highly Influenced

## Greedy Strikes Back: Improved Facility Location Algorithms

J. Algorithms • 1998
View 8 Excerpts
Highly Influenced

## Approximation Algorithms for Facility Location Problems (Extended Abstract)

STOC • 1997
View 6 Excerpts
Highly Influenced

## A simpler and better derandomization of an approximation algorithm for single source rent-or-buy

Oper. Res. Lett. • 2007
View 1 Excerpt
Highly Influenced

## Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM J. Comput. • 2003
View 1 Excerpt
Highly Influenced

## A new greedy approach for facility location problems

STOC • 2002
View 2 Excerpts
Highly Influenced

## Improved Approximation Algorithms for Metric Facility Location Problems

APPROX • 2002
View 2 Excerpts
Highly Influenced

## Provisioning a virtual private network: a network design problem for multicommodity flow

STOC • 2001
View 1 Excerpt
Highly Influenced