Zur Startseite gehen
0,00 €*
Cover: 9783642084690 | Approximation Algorithms | Vijay V. Vazirani | Taschenbuch | Paperback
Dekorationsartikel gehören nicht zum Leistungsumfang.
Approximation Algorithms
Taschenbuch von Vijay V. Vazirani
Sprache: Englisch

64,19 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con­ jecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of ap­ proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato­ rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly cat­ egorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them.
Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con­ jecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of ap­ proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato­ rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly cat­ egorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them.
Zusammenfassung
Spreads powerful algorithmic ideas developed in this area to practitionersWill accelerate progress in this areaRaises algorithmic awareness of the scientific community by showing simple ways of expressing complex algorithmic ideasAn indispensable cookbook for all serious mathematical programmers
Inhaltsverzeichnis
1 Introduction.- I. Combinatorial Algorithms.- 2 Set Cover.- 3 Steiner Tree and TSP.- 4 Multiway Cut and k-Cut.- 5 k-Center.- 6 Feedback Vertex Set.- 7 Shortest Superstring.- 8 Knapsack.- 9 Bin Packing.- 10 Minimum Makespan Scheduling.- 11 Euclidean TSP.- II. LP-Based Algorithms.- 12 Introduction to LP-Duality.- 13 Set Cover via Dual Fitting.- 14 Rounding Applied to Set Cover.- 15 Set Cover via the Primal¿Dual Schema.- 16 Maximum Satisfiability.- 17 Scheduling on Unrelated Parallel Machines.- 18 Multicut and Integer Multicommodity Flow in Trees.- 19 Multiway Cut.- 20 Multicut in General Graphs.- 21 Sparsest Cut.- 22 Steiner Forest.- 23 Steiner Network.- 24 Facility Location.- 25 k-Median.- 26 Semidefinite Programming.- III. Other Topics.- 27 Shortest Vector.- 28 Counting Problems.- 29 Hardness of Approximation.- 30 Open Problems.- A An Overview of Complexity Theory for the Algorithm Designer.- A.3.1 Approximation factor preserving reductions.- A.4 Randomized complexity classes.- A.5 Self-reducibility.- A.6 Notes.- B Basic Facts from Probability Theory.- B.1 Expectation and moments.- B.2 Deviations from the mean.- B.3 Basic distributions.- B.4 Notes.- References.- Problem Index.
Details
Erscheinungsjahr: 2010
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xix
380 S.
2 s/w Illustr.
ISBN-13: 9783642084690
ISBN-10: 3642084699
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Vazirani, Vijay V.
Auflage: Softcover reprint of hardcover 1st ed. 2001
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Maße: 235 x 155 x 22 mm
Von/Mit: Vijay V. Vazirani
Erscheinungsdatum: 08.12.2010
Gewicht: 0,61 kg
Artikel-ID: 107174507
Zusammenfassung
Spreads powerful algorithmic ideas developed in this area to practitionersWill accelerate progress in this areaRaises algorithmic awareness of the scientific community by showing simple ways of expressing complex algorithmic ideasAn indispensable cookbook for all serious mathematical programmers
Inhaltsverzeichnis
1 Introduction.- I. Combinatorial Algorithms.- 2 Set Cover.- 3 Steiner Tree and TSP.- 4 Multiway Cut and k-Cut.- 5 k-Center.- 6 Feedback Vertex Set.- 7 Shortest Superstring.- 8 Knapsack.- 9 Bin Packing.- 10 Minimum Makespan Scheduling.- 11 Euclidean TSP.- II. LP-Based Algorithms.- 12 Introduction to LP-Duality.- 13 Set Cover via Dual Fitting.- 14 Rounding Applied to Set Cover.- 15 Set Cover via the Primal¿Dual Schema.- 16 Maximum Satisfiability.- 17 Scheduling on Unrelated Parallel Machines.- 18 Multicut and Integer Multicommodity Flow in Trees.- 19 Multiway Cut.- 20 Multicut in General Graphs.- 21 Sparsest Cut.- 22 Steiner Forest.- 23 Steiner Network.- 24 Facility Location.- 25 k-Median.- 26 Semidefinite Programming.- III. Other Topics.- 27 Shortest Vector.- 28 Counting Problems.- 29 Hardness of Approximation.- 30 Open Problems.- A An Overview of Complexity Theory for the Algorithm Designer.- A.3.1 Approximation factor preserving reductions.- A.4 Randomized complexity classes.- A.5 Self-reducibility.- A.6 Notes.- B Basic Facts from Probability Theory.- B.1 Expectation and moments.- B.2 Deviations from the mean.- B.3 Basic distributions.- B.4 Notes.- References.- Problem Index.
Details
Erscheinungsjahr: 2010
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xix
380 S.
2 s/w Illustr.
ISBN-13: 9783642084690
ISBN-10: 3642084699
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Vazirani, Vijay V.
Auflage: Softcover reprint of hardcover 1st ed. 2001
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Maße: 235 x 155 x 22 mm
Von/Mit: Vijay V. Vazirani
Erscheinungsdatum: 08.12.2010
Gewicht: 0,61 kg
Artikel-ID: 107174507
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte

Taschenbuch
Cover: 9783709191330 | Physikalisch-chemisches Rechnen | Werner Fritz (u. a.) | Taschenbuch
Physikalisch-chemisches Rechnen
mit einer Einführung in die höhere Mathematik
EAN: 9783709191330
Sprache: Deutsch
Von/Mit: Werner Fritz (u. a.)

49,99 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9783642635816 | Complexity and Approximation | Giorgio Ausiello (u. a.) | Taschenbuch
Complexity and Approximation
Combinatorial Optimization Problems and Their Approximability Properties
EAN: 9783642635816
Sprache: Englisch
Von/Mit: Giorgio Ausiello (u. a.)

67,40 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9781119404477 | The Oliver Wight Class A Standard for Business Excellence | Buch
The Oliver Wight Class a Standard for Business Excellence
EAN: 9781119404477
Sprache: Englisch
Von/Mit: Oliver Wight International Inc

54,25 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9781916443334 | THE STRATEGY JOURNEY | Graham Christison | Taschenbuch | Paperback
THE STRATEGY JOURNEY
(includes Kickstarter Digital Mini-course + Worksheets)
EAN: 9781916443334
Sprache: Englisch
Von/Mit: Graham Christison

106,95 €*

Lieferzeit 1-2 Wochen

Buch
Cover: 9783846212080 | IT-Grundschutz Arbeitshandbuch | Informationstechnik | Buch | Deutsch
IT-Grundschutz Arbeitshandbuch
DIN ISO/IEC 27001, DIN ISO/IEC 27002; BSI-Standards 200-1/2/3
EAN: 9783846212080
Sprache: Deutsch
Von/Mit: BSI - Bundesamt für Sicherheit in der Informationstechnik

124,00 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9783658345198 | Entscheidungslehre | Rüdiger von Nitzsch | Taschenbuch | XIII | 2021
Entscheidungslehre
Wie Menschen entscheiden und wie sie entscheiden sollten
EAN: 9783658345198
Sprache: Deutsch
Von/Mit: Rüdiger von Nitzsch

29,99 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9780367540951 | Detecting Regime Change in Computational Finance | Jun Chen (u. a.)
Detecting Regime Change in Computational Finance
Data Science, Machine Learning and Algorithmic Trading
EAN: 9780367540951
Sprache: Englisch
Von/Mit: Edward P K Tsang

82,60 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9781800560413 | Data Engineering with AWS | Gareth Eagar | Taschenbuch | Paperback
Data Engineering with AWS
Learn how to design and build cloud-based data transformation pipelines using AWS
EAN: 9781800560413
Sprache: Englisch
Von/Mit: Gareth Eagar

75,50 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9783662653456 | Operations Research | Stefan Nickel (u. a.) | Taschenbuch | XIII
Operations Research
EAN: 9783662653456
Sprache: Deutsch
Von/Mit: Stefan Nickel (u. a.)

49,99 €*

Lieferzeit 1-2 Werktage

Taschenbuch
Cover: 9783658389932 | Künstliche Intelligenz heute | Gunnar Brune | Taschenbuch | Deutsch
Künstliche Intelligenz heute
Anwendungen aus Wirtschaft, Medizin und Wissenschaft
EAN: 9783658389932
Sprache: Deutsch
Von/Mit: Gunnar Brune

34,99 €*

Lieferzeit 1-2 Werktage

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...