Complexity and Approximation

Complexity and Approximation
Author :
Publisher : Springer Science & Business Media
Total Pages : 536
Release :
ISBN-10 : 9783642584121
ISBN-13 : 3642584128
Rating : 4/5 (128 Downloads)

Book Synopsis Complexity and Approximation by : Giorgio Ausiello

Download or read book Complexity and Approximation written by Giorgio Ausiello and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 536 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Complexity and Approximation Related Books

Complexity and Approximation
Language: en
Pages: 536
Authors: Giorgio Ausiello
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimizati
Design and Analysis of Approximation Algorithms
Language: en
Pages: 450
Authors: Ding-Zhu Du
Categories: Mathematics
Type: BOOK - Published: 2011-11-18 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for research
Combinatorial Optimization
Language: en
Pages: 596
Authors: Bernhard Korte
Categories: Mathematics
Type: BOOK - Published: 2006-01-27 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast
Approximation Algorithms and Semidefinite Programming
Language: en
Pages: 253
Authors: Bernd Gärtner
Categories: Mathematics
Type: BOOK - Published: 2012-01-10 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice
Approximation Algorithms for Combinatorial Optimization
Language: en
Pages: 290
Authors: Klaus Jansen
Categories: Computers
Type: BOOK - Published: 2003-07-31 - Publisher: Springer

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2