Inapproximability of Combinatorial Optimization Problems

Simple item page
dc.creatorTrevisan, Luca
dc.date2004-09-24
dc.date.accessioned2026-07-07T03:21:48Z
dc.date.available2026-07-07T03:21:48Z
dc.descriptionWe survey results on the hardness of approximating combinatorial optimization problems.
dc.identifierhttps://arxiv.org/abs/cs/0409043
dc.identifierhttp://arxiv.org/abs/cs/0409043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32343
dc.subjectComputational Complexity
dc.titleInapproximability of Combinatorial Optimization Problems
dc.typetext

Files

Collections

arXiv