Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation Algorithms for Combinatorial Optimization

APPROX 1998: Approximation Algorithms for Combinatiorial Optimization pp 1–13Cite as

Approximations of independent sets in graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1444))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, P. ErdŐs, J. Komlós, and E. Szemerédi. On Turán's theorem for sparse graphs. Combinaiorica, 1(4):313–317, 1981.

    MATH  Google Scholar 

  2. N. Alon and R. B. Boppana. The monotone complexity of Boolean functions. Combinatorica, 7(1):1–22, 1987.

    MATH  MathSciNet  Google Scholar 

  3. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized graph products. Computational Complexity, 5(1):60–75, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Alon and N. Kahale. Approximating the independence number via the α function. Math. Programming. To appear.

    Google Scholar 

  5. E. M. Arkin and R. Hassin. On local search for weighted k-set packing. ESA '97, LNCS 1284.

    Google Scholar 

  6. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. FOCS '92, 14–23.

    Google Scholar 

  7. V. Bafna, B. O. Narayanan, and R. Ravi. Non-overlapping local alignments (weighted independent sets of axis parallel rectangles). WADS '95, LNCS 955, 506–517.

    Google Scholar 

  8. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41:153–180, Jan. 1994.

    Article  MATH  Google Scholar 

  9. R. Bar-Yehuda and S. Moran. On approximation problems related to the independent set and vertex cover problems. Discrete Appl. Math., 9:1–10, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Berman and T. Fujito. On the approximation properties of independent set problem in degree 3 graphs. WADS '95, LNCS 955, 449–460.

    Google Scholar 

  11. P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. SODA '94, 365–371.

    Google Scholar 

  12. R. B. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32(2):180–196, June 1992.

    Article  MATH  MathSciNet  Google Scholar 

  13. B. Chandra and M. M. Halldórsson. Approximating weighted k-set-packing. Manuscript, May 1998.

    Google Scholar 

  14. M. Demange and V. T. Paschos. Improved approximations for maximum independent set via approximation chains. Appl. Math. Lett, 1996. To appear.

    Google Scholar 

  15. P. ErdŐs. Some remarks on chromatic graphs. Colloq. Math., 16:253–256, 1967.

    MathSciNet  Google Scholar 

  16. P. ErdŐs. On the graph theorem of Turán (in Hungarian). Mat. Lapok, 21:249–251, 1970.

    MathSciNet  Google Scholar 

  17. P. ErdŐs and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463–470, 1935.

    MathSciNet  Google Scholar 

  18. U. Feige. Randomized graph products, chromatic numbers, and the Lovász θ-function. Combinatorica, 17(1):79–90, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  19. M. M. Halldórsson. A still better performance guarantee for approximate graph coloring. Iriform. Process. Lett., 45:19–23, 25 January 1993.

    Article  MATH  Google Scholar 

  20. M. M. Halldórsson. Approximating discrete collections via local improvements. SODA '95, 160–169.

    Google Scholar 

  21. M. M. Halldórsson. Approximation via partitioning. Res. Report IS-RR-95-0003F, Japan Adv. Inst. of Sci. and Tech., Mar. 1995.

    Google Scholar 

  22. M. M. Halldórsson, J. Kratochvíl, and J. A. Telle. Independent sets with domination constraints. ICALP '98, LNCS.

    Google Scholar 

  23. M. M. Halldórsson and H. C. Lau. Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and 3-coloring. J. Graph Algo. Applic., 1(3):1–13, 1997.

    MATH  Google Scholar 

  24. M. M. Halldórsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree graphs. SWAT '94, LNCS 824, 195–206.

    Google Scholar 

  25. M. M. Halldórsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree via subgraph removal. Nordic J. Computing, 1(4):475–492, 1994.

    MATH  Google Scholar 

  26. M. M. Halldórsson and J. Radhakrishnan. Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica, 18:145–163, 1997.

    MATH  MathSciNet  Google Scholar 

  27. J. Håstad. Clique is hard to approximate within n 1−∈. FOCS '96, 627–636.

    Google Scholar 

  28. J. Håstad. Private communication, 1997.

    Google Scholar 

  29. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover, and set packing problems. Disc. Applied Math., 6:243–254, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  30. C. A. J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Disc. Math., 2(1):68–72, Feb. 1989.

    Article  MATH  MathSciNet  Google Scholar 

  31. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256–278, 1974.

    Article  MATH  Google Scholar 

  32. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. FOCS '94, 2–13.

    Google Scholar 

  33. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. FOCS '94, 819–830.

    Google Scholar 

  34. R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. FOCS '77, 162–170.

    Google Scholar 

  35. L. Lovász. On decomposition of graphs. Stud. Sci. Math. Hung., 1:237–238, 1966.

    MATH  Google Scholar 

  36. L. Lovász. Three short proofs in graph theory. J. Combin. Theory Ser. B, 19:269–271, 1975.

    Article  MATH  Google Scholar 

  37. L. Lovász. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory, IT-25(1):1–7, Jan. 1979.

    Article  Google Scholar 

  38. S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algorithms. FOCS '95, 162–169.

    Google Scholar 

  39. G. L. Nemhauser and L. Trotter. Vertex packings: Structural properties and algorithms. Math. Programming, 8:232–248, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  40. S. Vishwanathan. Personal communication, 1996.

    Google Scholar 

  41. A. Wigderson. Improving the performance guarantee for approximate graph coloring. J. ACM, 30(4):729–735, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  42. G. Yu and O. Goldschmidt. On locally optimal independent sets and vertex covers. Manuscript, 1993.

    Google Scholar 

  43. G. Yu and O. Goldschmidt. Local optimality and its application on independent sets for k-claw free graphs. Manuscript, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Science Institute, University of Iceland, Reykjavik, Iceland

    MagnÚs M. Halldórsson

  2. Department of Informatics, University of Bergen, Norway

    MagnÚs M. Halldórsson

Authors
  1. MagnÚs M. Halldórsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus Jansen José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halldórsson, M.M. (1998). Approximations of independent sets in graphs. In: Jansen, K., Rolim, J. (eds) Approximation Algorithms for Combinatiorial Optimization. APPROX 1998. Lecture Notes in Computer Science, vol 1444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053959

Download citation

  • DOI: https://doi.org/10.1007/BFb0053959

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64736-2

  • Online ISBN: 978-3-540-69067-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation