Inapproximability of Combinatorial Optimization Problems
Trevisan, Luca
Original · EN
We survey results on the hardness of approximating combinatorial optimization problems.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.