Complexity and Approximation

Complexity and Approximation
Author: Giorgio Ausiello
Publisher: Springer Science & Business Media
Total Pages: 536
Release: 2012-12-06
Genre: Computers
ISBN: 3642584128


Download Complexity and Approximation Book in PDF, Epub and Kindle

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
Language: en
Pages: 536
Authors: Giorgio Ausiello
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

GET EBOOK

This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimizati
Complexity and Approximation
Language: en
Pages: 298
Authors: Ding-Zhu Du
Categories: Computers
Type: BOOK - Published: 2020-02-20 - Publisher: Springer Nature

GET EBOOK

This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity ove
Approximation and Optimization
Language: en
Pages: 237
Authors: Ioannis C. Demetriou
Categories: Mathematics
Type: BOOK - Published: 2019-05-10 - Publisher: Springer

GET EBOOK

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading expert
Complexity and Approximation
Language: en
Pages: 524
Authors:
Categories: Combinatorial optimization
Type: BOOK - Published: 1999 - Publisher:

GET EBOOK

Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

GET EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.