On approximation properties of the Independent set problem for degree 3 graphs

  • Piotr Berman
  • Toshihiro Fujito
Invited Presentation

DOI: 10.1007/3-540-60220-8_84

Part of the Lecture Notes in Computer Science book series (LNCS, volume 955)
Cite this paper as:
Berman P., Fujito T. (1995) On approximation properties of the Independent set problem for degree 3 graphs. In: Akl S.G., Dehne F., Sack JR., Santoro N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg

Abstract

The main problem we consider in this paper is the Independent Set problem for bounded degree graphs. It is shown that the problem remains MAX SNP-complete when the maximum degree is bounded by 3. Some related problems are also shown to be MAX SNP-complete at the lowest possible degree bounds. Next we study better poly-time approximation of the problem for degree 3 graphs, and improve the previously best ratio, 5/4, to arbitrarily close to 6/5. This result also provides improved poly-time approximation ratios, B+3/5+ε, for odd degree B.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Piotr Berman
    • 1
  • Toshihiro Fujito
    • 2
  1. 1.Dept. of Computer Science and EngineeringThe Pennsylvania State UniversityUniversity ParkUSA
  2. 2.Dept. of Electrical EngineeringHiroshima UniversityHigashi-HiroshimaJapan

Personalised recommendations