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(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.
KeywordsProblem Instance Greedy Algorithm Triangle Inequality Approximation Ratio Improve Analysis
Unable to display preview. Download preview PDF.
- 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.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