Summary and Info
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.
Review and Comments
Rate the Book
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties 0 out of 5 stars based on 0 ratings.