Hardness of approximating problems on cubic graphs. Alimonti, P. & Kann, V. In Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC), pages 288–298, 1997.
bibtex   
@inproceedings {Alimonti1997Hardness,
	author = {Alimonti, Paola and Kann, Viggo},
	title = {Hardness of approximating problems on cubic graphs},
	booktitle = {Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC)},
	pages = {288--298},
	year = {1997},
}

Downloads: 0