Inapproximability of Combinatorial Optimization Problems [chapter]

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