Complexity and Approximation
2.1 hrs read
Rate this book:
About This Book
This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically will make the book an indispensible source of reference for professionals. The smooth integration of numerous illustrations, examples, and exercises make this monograph an ideal textbook.
Buy This Book
As an Amazon Associate and Bookshop.org affiliate, BookOrb earns from qualifying purchases.
Write a Review
Sign in to write a review.
More by G. Ausiello
Algoritmi, monaci e mercanti
Algoritmi, monaci e mercanti
Analysis and Design of Algorithms for Combinatorial Problems (North-holland Mathematical Library)
Caap'83
On the complexity of functions
On the complexity of functions defined by recurrence relations
Teoria degli algoritmi e della
Teoria degli algoritmi e della calcolabilità
Una introduzione alla manipola
Una introduzione alla manipolazione algebrica