Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties Corrected Edition. by G. Ausiello (Author). Complexity and Approximation. book cover by. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Springer Verlag, ISBN. Complexity and Approximation has 5 ratings and 2 reviews. Ushan said: The current state of knowledge of approximation algorithms. Giorgio Ausiello.
|Published (Last):||14 August 2014|
|PDF File Size:||9.80 Mb|
|ePub File Size:||4.47 Mb|
|Price:||Free* [*Free Regsitration Required]|
Goodreads helps you keep track of books you want to read. Want to Read saving…. Want to Read Currently Reading Read. Refresh and try again.
Complexity and Approximation
Open Preview See a Problem? Thanks for telling us about the problem. Return to Book Page. Preview — Complexity and Approximation by Giorgio Ausiello. 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. Hardcoverpages. Published February 1st by Springer first published November 9th To see what your friends thought of this book, please sign up. To ask other readers questions about Complexity and Approximationplease sign up. Be the first to ask a question about Complexity and Approximation. Lists with This Book. This book is not yet featured on Listopia. Dec 26, Ushan rated it liked it Shelves: The current state of knowledge of approximation algorithms.
Complexity and Approximation
As every undergraduate CS major learns and high schoolers can be taught to understandNP-complete problems most likely have no polynomial algorithms to solve them. Although the definition of NP talks about decision problems, many NP-complete problems are more naturally formulated as optimization problems; for example, “Given a graph G and an integer k, does G have a clique of size k or larger? The book also describes several approximation techniques and examples of proving inapproximability and ends with a Garey and Johnson-like catalogue of NP-complete problems and the knowledge of their approximability or inapproximability.
Overall, this book is less interesting than Vijay Varirani’s Approximation Algorithms, which goes through several representative NP-complete problems and discusses in detail the approximation algorithm for each.
Vazirani’s book is a monograph, while this book is a approxiamtion. If you are only going to read one book on approximation algorithms, get Vazirani’s book and not this one. Aug 19, Rhapsody rated it liked it Shelves: Gosh I really don’t feel like reading this book, but my advisor is teaching the class and he asked me to take it because he didn’t have enough students enrolled. Pravin Kumar rated it liked it Jan 07, Cenny Wenner rated it really liked it Apr 26, Mitch rated it liked it Nov 20, Rodrigo Monteiro marked it as to-read Aug 31, Brian33 added it Jun 08, Martisch marked it as to-read Feb 03, Gilles Simonin added it Oct 14, Anita marked it as to-read Jan 23, Tuy added it Apr 11, Wai-shing Luk marked it as to-read May 02, Paulo Siqueira marked it as to-read Aug 20, Jamie marked zusiello as to-read Oct 14, Telorian marked it as to-read Feb 03, Yu-Han Lyu added it Mar 05, Jon D marked it as to-read Jun 06, Foo Bar marked it as to-read Feb 17, There are no discussion topics on this book yet.
If complexify like books and love to build cool products, we may be looking for you. Books by Giorgio Ausiello. Trivia About Complexity and Ap No trivia or quizzes yet. Just a moment while we sign you in to your Goodreads account.