Carsten Lund
AT&T Bell Labs, Murray Hill, NJ
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing