Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability PropertiesGiorgio Ausiello (author), Pierluigi Crescenzi (author), Giorgio Gambosi (author), Viggo Kann (author), Alberto Marchetti-Spaccamela (author), Marco Protasi (author)
- We can order this
This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Number of pages: 524
Weight: 1381 g
Dimensions: 254 x 203 x 38 mm
Edition: 1st ed. 1999. Corr. 2nd printing 2002
You may also be interested in...
Please sign in to write a review