Johan Håstad
Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
ICALP, 2000.
@inproceedings{ICALP-2000-Hastad,
author = "Johan Håstad",
booktitle = "{Proceedings of the 27th International Colloquium on Automata, Languages and Programming}",
doi = "10.1007/3-540-45022-X_20",
isbn = "3-540-67715-1",
pages = "235",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?}",
volume = 1853,
year = 2000,
}











