Inapproximability of Combinatorial Optimization Problems
计算复杂性
2007-05-23 v1
摘要
We survey results on the hardness of approximating combinatorial optimization problems.
引用
@article{arxiv.cs/0409043,
title = {Inapproximability of Combinatorial Optimization Problems},
author = {Luca Trevisan},
journal= {arXiv preprint arXiv:cs/0409043},
year = {2007}
}