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 (21 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
Complexity and Approximation
Language: en
Pages: 298
Authors: Ding-Zhu Du
Categories: Computers
Type: BOOK - Published: 2020-02-20 - Publisher: Springer Nature

DOWNLOAD 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
Complexity and Approximation
Language: en
Pages: 524
Authors:
Categories: Combinatorial optimization
Type: BOOK - Published: 1999 - Publisher:

DOWNLOAD EBOOK

Approximation and Optimization
Language: en
Pages: 237
Authors: Ioannis C. Demetriou
Categories: Mathematics
Type: BOOK - Published: 2019-05-10 - Publisher: Springer

DOWNLOAD EBOOK

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading expert
Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

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