Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style
icon Submit Paper


RSS-Feed
REPORTS > KEYWORD > INAPPROXIMABILITY RESULTS:
Reports tagged with Inapproximability Results:
TR04-065 | 28th July 2004
Luca Trevisan

Inapproximability of Combinatorial Optimization Problems

 Revisions: 1

We survey results on the hardness of approximating combinatorial
optimization problems.

more >>>


ISSN 1433-8092 | Imprint