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

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

• Type: Conference
• Year: 2008
• Where: COCOA
• Authors: Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa
• Keywords: COCOA 2008, Connected Facility, Discrete Geometry, Nonnegative Edge Cost