Related Books
Language: en
Pages: 536
Pages: 536
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media
This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimizati
Language: en
Pages: 244
Pages: 244
Type: BOOK - Published: 2019-05-10 - Publisher: Springer
This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading expert
Language: en
Pages: 609
Pages: 609
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Language: en
Pages: 300
Pages: 300
Type: BOOK - Published: 2013-12-01 - Publisher: Springer Science & Business Media
Techniques and principles of minimax theory play a key role in many areas of research, including game theory, optimization, and computational complexity. In gen
Language: en
Pages: 253
Pages: 253
Type: BOOK - Published: 2012-01-10 - Publisher: Springer Science & Business Media
Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice
