Greed is good: Approximating independent sets in sparse and bounded-degree graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 439-448

  Halldórsson, Magnús M ^a   Radhakrishnam, Jaikumar ^b  

^a Japan Institute of Science and Technology   (Japan)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; SET THEORY;

APPROXIMATION RATIOS; BOUNDED DEGREE GRAPHS; CONSTANT DEGREE GRAPHS; GREEDY ALGORITHMS; INDEPENDENT SET; PARALLEL AND DISTRIBUTED ALGORITHMS; PERFORMANCE RATIO; RELAXATION TECHNIQUES;

GRAPHIC METHODS; ALGORITHMS;

GREEDY ALGORITHMS; INDEPENDENT SETS; SPARSE AND BOUNDED DEGREE GRAPHS;

EID: 0027929413     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195221     Document Type: Conference Paper

References (21)

1. M. Ajtai, J. Komlos, and E. Szemeredi. A note on Ramsey numbers. J. Combin. Theory Ser. A, 29:354-360, 1980.
2. N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992.
3. P. Berman and M. Furer. Approximating maximum independent set in bounded degree graphs. In Proc. Fifth ACM-SIAM Symp. on Discrete Algorithms, Jan. 1994.
4. R. B. Boppana and M. M. Halldorsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32(2): 180-196, June 1992.
5. V. Chvatal. A greedy heuristic for the set covering problem. Math. Oper. Res., 4:233-235, 1979.
6. V. Chvatal. Linear Programming. Freeman, New York, 1983.
7. P. Erdos. On the graph theorem of Turan (in Hungarian). Mat. Lapok, 21:249-251, 1970.
8. A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. In Proc. 19th ACM Symp. on Theory of Computing, pages 315-324, May 1987.
9. M. Goldberg and T. Spencer. An efficient parallel algorithm that finds independent sets of guaranteed size. In Proc. First ACM-SIAM Symp. on Discrete Algorithms, pages 219-225, Jan. 1990.
10. M. M. Halldorsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree graphs. Manuscript, Feb. 1994.
11. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover, and set packing problems. Disc. Applied Math., 6:243-254, 1983.
12. D. S. Johnson. Worst case behavior of graph coloring algorithms. In Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, and Computing. Congressus Numerantium X, pages 513-527, 1974.
13. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computation views of approximability. Manuscript, Dec. 1993.
14. B. Monien and E. Speckenmeyer. Some further approximation algorithms for the vertex cover problem. In Lecture Notes in Computer Science #159, pages 341-349. Springer Verlag, 1983.
15. G. L. Nemhauser and W. T. Trotter. Vertex packing: Structural properties and algorithms. Math. Programming, 8:232-248, 1975.
16. A. Panconesi and A. Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. In Proc. 24nd Ann. ACM Symp. on Theory of Computing, pages.
17. V. T. Paschos. A (δ/2)-Approximation algorithm for the maximum independent set problem. Inf. Process. Lett., 44:11-13, Nov. 1992.
18. J. B. Shearer. A note on the independence number of triangle-free graphs. Discrete Math., 46:83-87, 1983.
19. J. B. Shearer. A note on the independence number of triangle-free graphs, II. J. Combin. Theory Ser. B, 53:300-307, 1991.
20. H. U. Simon. On approximate solutions for combinatorial optimization problems. SIAM J. Disc. Math., 3(2):294-310, May 1990.
21. P. Turan. On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok, 48:436-452, 1941.