Complexity and Approximation

Complexity and Approximation

Combinatorial Optimization Problems and Their Approximability Properties

by Giorgio Ausiello

524 pages· 1999· ISBN 9783540654315
Join Readfeed freeFind clubs reading this bookBrowse readable books
About
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.

Discuss Complexity and Approximation with other readers

Join or start a book club for Complexity and Approximation on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Complexity and Approximation?

Sign up free on Readfeed, then browse public clubs or start your own club with Complexity and Approximation as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Complexity and Approximation with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Complexity and Approximation with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.