Covers theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. This book contains useful algorithms and results about the intrinsic complexity of combinatorial problems. It is of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.
- Limba : Engleza
- Data Publicarii : 02 Jul 2001
- Editie : 1st ed. 2001. Corr. 2nd printing 2002
- Format : Hardback
- Numar pagini : 380
- ISBN : 9783540653677