Inapproximability of Combinatorial Optimization Problems
<|reference_start|>Inapproximability of Combinatorial Optimization Problems: We survey results on the hardness of approximating combinatorial optimization problems.<|reference_end|>
@article{trevisan2004inapproximability,
    title={Inapproximability of Combinatorial Optimization Problems},
    author={Luca Trevisan},
    journal={arXiv preprint arXiv:cs/0409043},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0409043},
    primaryClass={cs.CC}
}