Abstract
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.
This research was supported in part by the National Science Foundation under grant 0305954. It was performed while the first author was at Washington University in St. Louis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kuby, M.: Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geographical Analysis 19(4), 315–329 (1987)
Ravi, S.S., Rosencrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Operations Research 42, 299–310 (1994)
Chandra, B., Halldorsson, M.M.: Approximation algorithms for dispersion problems. J. Algorithms 38, 438–465 (2001)
Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Operations Research Letters 21, 133–137 (1997)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Birnbaum, B.E., Goldman, K.J. (2006). An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2006 2006. Lecture Notes in Computer Science, vol 4110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11830924_7
Download citation
DOI: https://doi.org/10.1007/11830924_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38044-3
Online ISBN: 978-3-540-38045-0
eBook Packages: Computer ScienceComputer Science (R0)