Bookmark Saya

arXiv Open Access 2004

Inapproximability of Combinatorial Optimization Problems

Luca Trevisan
Lihat Sumber

Abstrak

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

Topik & Kata Kunci

cs.CC

Penulis (1)

L

Luca Trevisan

Format Sitasi

APA MLA BibTeX
Trevisan, L. (2004). Inapproximability of Combinatorial Optimization Problems. https://arxiv.org/abs/cs/0409043

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2004
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓