Miroslav Chlebík, Janka Chlebíková. Approximation hardness of optimization problems in intersection graphs of ::::d::::-dimensional boxes. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005. pages 267-276, SIAM, 2005. [doi]
No references recorded for this publication.
No citations of this publication recorded.