• Sign In / Register
  • Help
  • Basket0
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
  • Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
zoom

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

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

Usually despatched 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...

Understanding Cryptography
Added to basket
Introduction to Algorithms
Added to basket
The End of Error
Added to basket
Algorithms Unlocked
Added to basket
Algorithmic Problem Solving
Added to basket
Algorithms
Added to basket
£66.99
Hardback
Concise Guide to Databases
Added to basket
Purely Functional Data Structures
Added to basket
Introduction to Algorithms
Added to basket
Machine Learning
Added to basket
£39.99
Paperback
Understanding Cryptography
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.