We may earn an affiliate commission when you visit our partners.

Complexity and Approximation

Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi

This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems.

Read this on Amazon

Available editions

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Paperback

$$$

Save this book

Save Complexity and Approximation to your list so you can find it easily later:

Save

Help others find this book page by sharing it with your friends and followers:

Facebook

Copy Link

Length: 536 pages

Share and help others discover this book.

Facebook

Link

Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.