Abstract
The classical greedy heuristic for approximating maximum independent set is simple and efficient. It achieves a performance ratio bound of (Δ + 2)/3, where Δ is the degree of the input graph. All known algorithms for the problem with better ratio bounds are complicated and run slowly for moderately large Δ. In this paper, we describe a natural extension of the greedy heuristic. It is as simple and as efficient as the classical greedy heuristic. By a careful analysis on the structure of the intermediate graphs manipulated by our heuristic, we prove that the ratio bound is improved to (Δ + 3)/3:25.
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
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problem. In Proceedings of the 33th IEEE Annual Symposium on Foundations of Computer Science, 1992.
P. Berman and M. Fűrer. Approximating maximum independent set in bounded degree graphs. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 365–371, 1994.
R. Boppana and M. Halldorsson. Approximating maximum independent sets by excluding subgraphsr. BIT, pages 180–196, 1992.
M. Halldórsson and J. Radhakrishnan. Greed is good: Approximating independent sets in sparse and bounded-degree graph. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 439–448, 1994.
M. Halldórsson and J. Radhakrishnan. Greedy approximations of independent sets in low degree graphs. In Proceedings of the 6th International Symposium on Algorithms and Computation, 1995.
M. Halldórsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree graphs via subgraph removal. Nordic Journal of Computing, pages 275–292, 1995.
J. Håstad. Clique is hard to approximate within n 1 − ∈. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 627–636, 199
H.Y. Lau. The power of greediness-a general methodology for designing approximation algorithms. MPhil. thesis, The University of Hong Kong, Hong Kong, 1998.
G.L. Nemhauser and W.T. Trotter. Vertex packing: Structural properties and algorithms. Mathematics Programming, pages 232–248, 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lau, H.Y., Ting, H.F. (1999). The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_48
Download citation
DOI: https://doi.org/10.1007/3-540-48686-0_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66200-6
Online ISBN: 978-3-540-48686-2
eBook Packages: Springer Book Archive