Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Algorithmics for Hard Problems
Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Taschenbuch von Juraj Hromkovi¿
Sprache: Englisch

59,60 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-4 Werktage

Kategorien:
Beschreibung
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech­ nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami­ cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in­ cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com­ municated to students and practitioners.
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech­ nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami­ cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in­ cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com­ municated to students and practitioners.
Zusammenfassung
A textbook as well as a handbook on the kernel of current algorithmics
With many examples to support the understanding
Inhaltsverzeichnis
1 Introduction.- 2 Elementary Fundamentals.- 3 Deterministic Approaches.- 4 Approximation Algorithms.- 5 Randomized Algorithms.- 6 Heuristics.- 7 A Guide to Solving Hard Problems.- References.
Details
Erscheinungsjahr: 2010
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xiv
538 S.
19 s/w Illustr.
ISBN-13: 9783642079092
ISBN-10: 3642079091
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Hromkovi¿, Juraj
Auflage: Softcover reprint of hardcover 2nd edition 2003
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 30 mm
Von/Mit: Juraj Hromkovi¿
Erscheinungsdatum: 09.12.2010
Gewicht: 0,832 kg
Artikel-ID: 107167400
Zusammenfassung
A textbook as well as a handbook on the kernel of current algorithmics
With many examples to support the understanding
Inhaltsverzeichnis
1 Introduction.- 2 Elementary Fundamentals.- 3 Deterministic Approaches.- 4 Approximation Algorithms.- 5 Randomized Algorithms.- 6 Heuristics.- 7 A Guide to Solving Hard Problems.- References.
Details
Erscheinungsjahr: 2010
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xiv
538 S.
19 s/w Illustr.
ISBN-13: 9783642079092
ISBN-10: 3642079091
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Hromkovi¿, Juraj
Auflage: Softcover reprint of hardcover 2nd edition 2003
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 30 mm
Von/Mit: Juraj Hromkovi¿
Erscheinungsdatum: 09.12.2010
Gewicht: 0,832 kg
Artikel-ID: 107167400
Sicherheitshinweis

Ähnliche Produkte

Ähnliche Produkte