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

  • Benjamin E. Birnbaum
  • Kenneth J. Goldman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4110)


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(pdn d ), 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.


Problem Instance Greedy Algorithm Triangle Inequality Approximation Ratio Improve Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kuby, M.: Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geographical Analysis 19(4), 315–329 (1987)CrossRefGoogle Scholar
  2. 2.
    Ravi, S.S., Rosencrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Operations Research 42, 299–310 (1994)MATHCrossRefGoogle Scholar
  3. 3.
    Chandra, B., Halldorsson, M.M.: Approximation algorithms for dispersion problems. J. Algorithms 38, 438–465 (2001)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Operations Research Letters 21, 133–137 (1997)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50, 795–824 (2003)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 264–273. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  7. 7.
    Birnbaum, B.E.: The remote-clique problem revisited: Undergraduate honors thesis. Technical Report WUCSE-2006-26, Washington University Department of Computer Science and Engineering, St. Louis, MO, USA (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Benjamin E. Birnbaum
    • 1
  • Kenneth J. Goldman
    • 2
  1. 1.Department of Computer Science and EngineeringUniversity of Washington, SeattleSeattleUSA
  2. 2.Department of Computer Science and EngineeringWashington University in St. LouisSt. LouisUSA

Personalised recommendations