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
{"_id":"JferDBZmx22rD7puL","bibbaseid":"alimonti-kann-hardnessofapproximatingproblemsoncubicgraphs-1997","author_short":["Alimonti, P.","Kann, V."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Alimonti"],"firstnames":["Paola"],"suffixes":[]},{"propositions":[],"lastnames":["Kann"],"firstnames":["Viggo"],"suffixes":[]}],"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","bibtex":"@inproceedings {Alimonti1997Hardness,\n\tauthor = {Alimonti, Paola and Kann, Viggo},\n\ttitle = {Hardness of approximating problems on cubic graphs},\n\tbooktitle = {Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC)},\n\tpages = {288--298},\n\tyear = {1997},\n}\n\n","author_short":["Alimonti, P.","Kann, V."],"key":"Alimonti1997Hardness","id":"Alimonti1997Hardness","bibbaseid":"alimonti-kann-hardnessofapproximatingproblemsoncubicgraphs-1997","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/BZWfBuZY3E6mypcu8","dataSources":["5GsqcumS3vErfsixj"],"keywords":[],"search_terms":["hardness","approximating","problems","cubic","graphs","alimonti","kann"],"title":"Hardness of approximating problems on cubic graphs","year":1997}