Abstract
In the unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters such as the number of vertices, maximum degree, and average degree. In the weighted case, no corresponding results are possible for average degree, since inserting the vertices with small weight decreases the average degree arbitrarily without significantly changing the approximation ratio. In this paper, we introduce weighted measures, namely “weighted” average degree and “weighted” inductiveness, and analyze algorithms for the weighted independent set problem in terms of these parameters.
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
Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, 2nd edn. Springer, Heidelberg (1993)
Halldórsson, M.M.: Approximations of weighted independent set and hereditary subset problems. Journal of Graphs Algorithms and Applications 4(1), 1–16 (2000)
Halldórsson, M.M.: Approximations of independent sets in graphs. In: Jansen, K., Rolim, J. (eds.) The First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 1–14 (1998)
Halldórsson, M.M., Lau, H.C.: Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and 3-coloring. Journal of Graph Algorithms and Applications 1(3), 1–13 (1997)
Halldórsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18, 145–163 (1997)
Halldórsson, M.M., Radhakrishnan, J.: Improved approximations of independent sets in bounded-degree graphs via subgraph removal. Nordic Journal of Computing 1(4), 475–482 (1994)
Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6, 243–254 (1983)
Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. Journal of the Association for Computing Machinery 30(2), 417–427 (1983)
Nemhauser, G.L., Trotter, L.E.: Vertex packing: Structural properties and algorithms. Mathematical Programming 8, 232–248 (1975)
Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithms for maximum weighted independent set problem. Discrete Applied Mathematics 126, 313–322 (2003)
Schrijver, A.: Combinatorial optimization: polyhedra and efficiency, vol. A. Springer, Heidelberg (2003)
Vazirani, V.V.: Approximation algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kako, A., Ono, T., Hirata, T., Halldórsson, M.M. (2005). Approximation Algorithms for the Weighted Independent Set Problem. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_30
Download citation
DOI: https://doi.org/10.1007/11604686_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)