Visit our Christmas Gift Finder
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Hardback)
  • Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Hardback)
zoom

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Hardback)

(author), (author), (author), (author), (author), (author)
£78.03
Hardback 524 Pages / Published: 03/12/2002
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket

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
ISBN: 9783540654315
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...

Machine Learning
Added to basket
£39.99
Paperback
Algorithms
Added to basket
£66.49
Hardback
Generative Art
Added to basket
£25.99
Paperback
Introduction to Algorithms
Added to basket
Algorithms Unlocked
Added to basket
Understanding Cryptography
Added to basket
Purely Functional Data Structures
Added to basket
Gynaecology: Evidence-Based Algorithms
Added to basket
Understanding Cryptography
Added to basket

Please sign in to write a review

Your review has been submitted successfully.