Johan Håstad. Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 235, Springer, 2000. [doi]
@inproceedings{Hastad00,
title = {Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?},
author = {Johan Håstad},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1853/18530235.htm},
tags = {optimization},
researchr = {https://researchr.org/publication/Hastad00},
cites = {0},
citedby = {0},
pages = {235},
booktitle = {Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
editor = {Ugo Montanari and José D. P. Rolim and Emo Welzl},
volume = {1853},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67715-1},
}