Hardness of Approximating Problems on Cubic Graphs

  title={Hardness of Approximating Problems on Cubic Graphs},
  author={Paola Alimonti and Viggo Kann},
Four fundamental graph problems, Minimum vertex cover, Max imum 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 t i e approximation scheme on input graphs of degree bounded by three. 
Highly Influential
This paper has highly influenced 30 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.
Showing 1-10 of 88 extracted citations


Publications referenced by this paper.
Showing 1-10 of 22 references

On the Approximability of NP-Complete Optimiza tion Problems

  • V. Kann
  • PhD Thesis, Department of Numerical Analysis and…
  • 1992
Highly Influential
6 Excerpts


  • C. H. Papadimitriou, M. Yannakakis
  • a pproximation, and complexity classes, J…
  • 1991
Highly Influential
8 Excerpts

Free Bits

  • M. Bellare, O. Goldreich, M. Sudan
  • PCPs and n on-approximability-towards tight…
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…