The inapproximability of non-NP-hard optimization problems
| Autor: | Cai, Liming, Juedes, David *, Kanj, Iyad |
|---|---|
| Zdroj: | In Theoretical Computer Science 2002 289(1):553-571 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
| Autor: | Cai, Liming, Juedes, David *, Kanj, Iyad |
|---|---|
| Zdroj: | In Theoretical Computer Science 2002 289(1):553-571 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
Full Text from ScienceDirect