Budget constrained minimum cost connected medians

• Published in: Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 2; no. 4; pp. 453 - 469
• Main Authors: Konjevod, Goran, Krumke, Sven O., Marathe, Madhav V.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.12.2004
• Subjects: Approximation algorithms; Group Steiner Tree Problem; k-Median Problem; Median; Network design; NP-hardness; NP-hardness; Group Steiner Tree Problem; Approximation algorithms; Median; k-Median Problem; Network design
• ISSN: 1570-8667; 1570-8675
• DOI: 10.1016/j.jda.2004.04.006

Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we study a graph-theoretic problem that aims to simultaneously address a network design task and a location-theoretic constraint. The Budget Constrained Connected Median Problem is the following: We are given an undirected graph G=( V, E) with two different edge-weight functions c (modeling the construction or communication cost) and d (modeling the service distance), and a bound B on the total service distance. The goal is to find a subtree T of G with minimum c-cost c( T) subject to the constraint that the sum ∑ v∈ V⧹ T dist d ( v, T) of the service distances of all the remaining nodes v∈ V⧹ T does not exceed the specified budget B. Here, the service distance dist d ( v, T) denotes the shortest path distance of v to a vertex in T with respect to d. This problem has applications in optical network design and the efficient maintenance of distributed databases. We formulate this problem as a bicriteria network design problem, and present bicriteria approximation algorithms. We also prove lower bounds on the approximability of the problem which demonstrate that our performance ratios are close to best possible.