product iamge

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi

Language: English
Pages: 538

Contents......Page 8
Preface......Page 13
1 The Complexity of Optimization Problems......Page 20
2 Design Techniques for Approximation Algorithms......Page 57
3 Approximation Classes......Page 104
4 Input-Dependent and Asymptotic Approximation......Page 140
5 Approximation through Randomization......Page 169
6 NP, PCP and Non-approximability Results......Page 191
7 The PCP theorem......Page 222
8 Approximation Preserving Reductions......Page 267
9 Probabilistic analysis of approximation algorithmsof......Page 301
10
Heuristic methods......Page 335
Appendix A:
Mathematical preliminaries......Page 366
Appendix B:
A List of NP Optimization Problems......Page 380
Bibliography......Page 484
Index......Page 528