On the hardness of approximating minimization problems.

Carsten Lund, Mihalis Yannakakis

Browse the full STOC paper archive.