Inapproximability of Combinatorial Optimization Problems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32343

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0409043
 http://arxiv.org/abs/cs/0409043

Collections

arXiv