
Approximation Algorithms
This text deals with algorithms designed for approximating solutions to a certain class of problems, called NP-hard combinatorial optimization problems. In particular, it focuses on the design of polynomial-time approximation algorithms.
- Forfatter
- Vijay V. Vazirani
- Opplag
- 1st ed. 2001. Corr. 2nd printing 2002
- ISBN
- 9783540653677
- Språk
- Engelsk
- Vekt
- 446 gram
- Utgivelsesdato
- 2.7.2001
- Antall sider
- 380
