Hardness of Approximating Problems on Cubic Graphs

Paola Alimonti, Viggo Kann. Hardness of Approximating Problems on Cubic Graphs. In Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista, editors, Algorithms and Complexity, Third Italian Conference, CIAC 97, Rome, Italy, March 12-14, 1997, Proceedings. Volume 1203 of Lecture Notes in Computer Science, pages 288-298, Springer, 1997.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.