Finding subsets maximizing minimum structures

We consider the problem of finding a set of k vertices in a graph that are in some sense remote. Stated more formally, given a graph G and an integer k, find a set P of k vertices for which the total weight of a minimum structure on P is maximized. In particular, we are interested in three problems of this type, where the structure to be minimized is a spanning tree (Remote-MST), Steiner tree, or traveling salesperson tour. We study a natural greedy algorithm that simultaneously approximates all three problems on metric graphs. For instance, its performance ratio for Remote-MST is exactly 4, while this problem is NP -hard to approximate within a factor of less than 2. We also give a better approximation for graphs induced by Euclidean points in the plane, present an exact algorithm for graphs whose distances correspond to shortest-path distances in a tree, and prove hardness and approximability results for general graphs.

[1]  Leonidas J. Guibas,et al.  Finding extremal polygons , 1982, STOC '82.

[2]  I. Moon,et al.  An Analysis of Network Location Problems with Distance Constraints , 1984 .

[3]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[4]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[5]  Erhan Erkut,et al.  Analytical models for locating undesirable facilities , 1989 .

[6]  Ding-Zhu Du,et al.  An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Douglas J. White.  The maximal dispersion problem and the "First point outside the neighbourhood" heuristic , 1991, Comput. Oper. Res..

[8]  S. S. Ravi,et al.  Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract) , 1991, WADS.

[9]  Arie Tamir,et al.  Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..

[10]  Alok Aggarwal,et al.  Finding k Points with Minimum Diameter and Related Problems , 1991, J. Algorithms.

[11]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[12]  David Eppstein,et al.  New algorithms for minimum area k-gons , 1992, SODA '92.

[13]  Guy Kortsarz,et al.  On choosing a dense subgraph , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[14]  Alok Aggarwal,et al.  Finding a minimum weight K-link path in graphs with Monge property and applications , 1993, SCG '93.

[15]  Shietung Peng,et al.  Algorithms for a Core and k-Tree Core of a Tree , 1993, J. Algorithms.

[16]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

[17]  Dorit S. Hochbaum,et al.  An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane , 1994, STOC '94.

[18]  Matteo Fischetti,et al.  Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[19]  Santosh S. Vempala,et al.  Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.

[20]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[21]  Hisao Tamaki,et al.  Greedily Finding a Dense Subgraph , 1996, J. Algorithms.

[22]  Barun Chandra,et al.  Facility Dispersion and Remote Subgraphs , 1995, SWAT.

[23]  Takeaki Uno,et al.  A Linear Time Algorithm for Finding a k-Tree Core , 1997, J. Algorithms.