Skip to main content
Conference Proceedings

Hardness of approximating problems on cubic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1203 288-298
DOI: 10.1007/3-540-62592-5_80
96Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. This means that unless P=NP these problems do not admit any polynomial time approximation scheme on input graphs of degree bounded by three.

Cite

CITATION STYLE

APA

Alimonti, P., & Kann, V. (1997). Hardness of approximating problems on cubic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1203, pp. 288–298). Springer Verlag. https://doi.org/10.1007/3-540-62592-5_80

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free