Inapproximability of Combinatorial Optimization Problems [chapter]

Luca Trevisan
2013 Paradigms of Combinatorial Optimization  
We survey results on the hardness of approximating combinatorial optimization problems. *
doi:10.1002/9781118600207.ch13 fatcat:xjl7lrlwmje3nguo6etwiuzxwi