An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs

Given a positive integer p and a complete graph with non-negative edge weights that satisfy the triangle inequality, the remote-clique problem is to find a subset of p vertices having a maximum-weight induced subgraph. A greedy algorithm for the problem has been shown to have an approximation ratio of 4, but this analysis was not shown to be tight. In this paper, we present an algorithm called d-Greedy Augment that generalizes this greedy algorithm (they are equivalent when d = 1). We use the technique of factor-revealing linear programs to prove that d-Greedy Augment, which has a running time of O(pdnd), achieves an approximation ratio of (2p – 2)/(p + d – 2). Thus, when d = 1, d-Greedy Augment achieves an approximation ratio of 2 and runs in time O(pn), making it the fastest known 2-approximation for the remote-clique problem. The usefulness of factor-revealing LPs in the analysis of d-Greedy Augment suggests possible applicability of this technique to the study of other approximation algorithms.

[1]  Andrzej Czygrinow Maximum dispersion problem in dense graphs , 2000, Oper. Res. Lett..

[2]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[3]  Barun Chandra,et al.  Approximation Algorithms for Dispersion Problems , 2001, J. Algorithms.

[4]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[5]  Michael Kuby Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems , 1988 .

[6]  Sándor P. Fekete,et al.  Approximation of Geometric Dispersion Problems , 1998, Algorithmica.

[7]  Aranyak Mehta,et al.  AdWords and Generalized On-line Matching , 2005, FOCS.

[8]  Takeshi Tokuyama,et al.  Finding subsets maximizing minimum structures , 1995, SODA '95.

[9]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[10]  Evangelos Markakis,et al.  A Greedy Facility Location Algorithm Analyzed Using Dual Fitting , 2001, RANDOM-APPROX.

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

[12]  S. S. Ravi,et al.  Heuristic and Special Case Algorithms for Dispersion Problems , 1994, Oper. Res..

[13]  S. S. Ravi,et al.  Facility Dispersion Problems Under Capacity and Cost Constraints , 2000, J. Comb. Optim..

[14]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[15]  Sándor P. Fekete,et al.  Maximum Dispersion and Geometric Maximum Weight Cliques , 2003, Algorithmica.

[16]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[17]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[18]  Refael Hassin,et al.  Approximation algorithms for maximum dispersion , 1997, Oper. Res. Lett..

[19]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .