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

Abstract Given a positive integer k and a complete graph with non-negative edge weights satisfying the triangle inequality, the remote-clique problem is to find a subset of k 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 use the technique of factor-revealing linear programs to show that the greedy algorithm actually achieves an approximation ratio of 2, which is tight.

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

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

[3]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[4]  S. S. Ravi,et al.  Obtaining online approximation algorithms for facility dispersion from offline algorithms , 2006, Networks.

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

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

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

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

[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]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

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

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

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

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

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

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

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

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