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]
Abstract is missing.