Approximation algorithms for the weighted independent set problem in sparse graphs

Discrete Applied Mathematics

Volumn 157, Issue 4, 2009, Pages 617-626

  Kako, Akihisa ^a   Ono, Takao ^a   Hirata, Tomio ^a   Halldórsson, Magnús M ^b  

^a NAGOYA UNIVERSITY   (Japan)

^b REYKJAVIK UNIVERSITY   (Iceland)

Author keywords

Approximation algorithm; Weighted degree; Weighted independent set problem

Indexed keywords

ALGORITHMS;

APPROXIMABILITY; APPROXIMATION ALGORITHM; APPROXIMATION RATIOS; AVERAGE DEGREES; INDEPENDENT SET PROBLEMS; SPARSE GRAPHS; WEIGHTED AVERAGES; WEIGHTED DEGREE; WEIGHTED INDEPENDENT SET PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 59749095028     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.08.027     Document Type: Article

References (15)

1. Arora S., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and hardness of approximation problems. Journal of the ACM 45 3 (1998) 501-555
2. Berman P., and Fujito T. On approximation properties of the independent set problem for low degree graphs. Theory of Computing Systems 32 2 (1999) 115-132
3. Demange M., and Paschos V. Improved approximations for weighted and unweighted graph problems. Theory of Computing Systems 38 6 (2005) 763-787
4. Grötschel M., Lovász L., and Schrijver A. Geometric algorithms and combinatorial optimization. 2nd ed. (1993), Springer-Verlag
5. M. Halldórsson, Approximations of independent sets in graphs, in: The First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 1998
6. Halldórsson M. Approximations of weighted independent set and hereditary subset problems. Journal of Graph Algorithms and Applications 4 1 (2000) 1-16
7. Halldórsson M., and Lau H. 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 (1997) 1-13
8. Halldórsson M., and Radhakrishnan J. Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18 (1997) 45-163
9. Hochbaum D. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6 (1983) 243-254
10. Karger D., Motwani R., and Sudan M. Approximate graph coloring by semidefinite programming. Journal of the ACM 45 2 (1998) 246-265
11. Matula D., and Beck L. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM 30 2 (1983) 417-427
12. Nemhauser G., and Trotter L. Vertex packing: Structural properties and algorithms. Mathematical Programming 8 (1975) 232-248
13. Sakai S., Togasaki M., and Yamazaki K. A note on greedy algorithms for maximum weighted independent set problem. Discrete Applied Mathematics 126 (2003) 313-322
14. Schrijver A. Combinatorial optimization: Polyhedra and efficiency Vol. A (2003), Springer-Verlag
15. Vazirani V. Approximation algorithms (2001), Springer-Verlag