Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem

  • Authors:

  • Hyunwoo Jung;Mohammad Khairul Hasan;Kyung-Yong Chwa

  • Affiliations:

  • Division of Computer Science, Korea Advanced Institute of Science and Technology, , Daejeon, Republic of Korea;Division of Computer Science, Korea Advanced Institute of Science and Technology, , Daejeon, Republic of Korea;Division of Computer Science, Korea Advanced Institute of Science and Technology, , Daejeon, Republic of Korea

  • Venue:
  • COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

In the Connected Facility Location(ConFL) problem, we are given a graph G= (V, E) with nonnegative edge cost ceon the edges, a set of facilities $\mathcal{F}\subset V$, a set of demands, i.e., clients $\mathcal{D}\subset V$, and a parameter M驴 1. Each facility ihas a nonnegative opening cost fiand each client jhas djunits of demand. Our objective is to open some facilities, say $F\subset \mathcal{F}$, assign each demand jto some open facility i(j) 驴 Fand connect all open facilities using a Steiner tree Tsuch that the total cost, which is $\sum_{i \in F} f_i + \sum_{j \in \mathcal D}d_jc_{i(j)j} + M \sum_{e \in T}c_e$, is minimized.We give an improved primal-dual 6.55-approximation algorithm for the ConFL problem which improves the Swamy and Kumar's primal-dual 8.55-approximation algorithm [1].