The approximability of NP-hard problems

Sanjeev Arora
1998 Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98  
doi:10.1145/276698.276784 dblp:conf/stoc/Arora98 fatcat:yu5xnmrhsbd2xk7m6aanrb5ule