55,40 €
UVP 64,19 €
Versandkostenfrei per Post / DHL
Lieferzeit 2-4 Werktage
This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field.
This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.
This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field.
This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.
| Erscheinungsjahr: | 2010 |
|---|---|
| Genre: | Informatik, Mathematik, Medizin, Naturwissenschaften, Technik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Inhalt: |
xix
380 S. 2 s/w Illustr. |
| ISBN-13: | 9783642084690 |
| ISBN-10: | 3642084699 |
| Sprache: | Englisch |
| Einband: | Kartoniert / Broschiert |
| Autor: | Vazirani, Vijay V. |
| Auflage: | Softcover reprint of hardcover 1st edition 2001 |
| Hersteller: |
Springer Berlin
Springer Berlin Heidelberg |
| Verantwortliche Person für die EU: | Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com |
| Maße: | 235 x 155 x 22 mm |
| Von/Mit: | Vijay V. Vazirani |
| Erscheinungsdatum: | 08.12.2010 |
| Gewicht: | 0,61 kg |
Ähnliche Produkte
Lieferzeit 1-2 Wochen
Lieferzeit 2-4 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen