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

Piotr Berman, Toshihiro Fujito

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    67 Scopus citations

    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 SJVP-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, |, to arbitrarily close to |. This result also provides improved poly-time approximation ratios, (Formula Presented), for odd degree B.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings
    EditorsSelim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
    PublisherSpringer Verlag
    Pages449-460
    Number of pages12
    ISBN (Print)3540602208, 9783540602200
    DOIs
    StatePublished - Jan 1 1995
    Event4th Workshop on Algorithms and Data Structures, WADS 1995 - Kingston, Canada
    Duration: Aug 16 1995Aug 18 1995

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume955
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other4th Workshop on Algorithms and Data Structures, WADS 1995
    CountryCanada
    CityKingston
    Period8/16/958/18/95

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'On approximation properties of the independent set problem for degree 3 graphs'. Together they form a unique fingerprint.

  • Cite this

    Berman, P., & Fujito, T. (1995). On approximation properties of the independent set problem for degree 3 graphs. In S. G. Akl, F. Dehne, J-R. Sack, & N. Santoro (Eds.), Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings (pp. 449-460). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 955). Springer Verlag. https://doi.org/10.1007/3-540-60220-8_84