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]
@inproceedings{ChlebikC05,
title = {Approximation hardness of optimization problems in intersection graphs of ::::d::::-dimensional boxes},
author = {Miroslav Chlebík and Janka Chlebíková},
year = {2005},
doi = {10.1145/1070432.1070470},
url = {http://doi.acm.org/10.1145/1070432.1070470},
tags = {optimization, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ChlebikC05},
cites = {0},
citedby = {0},
pages = {267-276},
booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005},
publisher = {SIAM},
isbn = {0-89871-585-7},
}