E-Book, Englisch, 494 Seiten, eBook
Reihe: Texts in Theoretical Computer Science. An EATCS Series
Hromkovic / Hromkovic Algorithmics for Hard Problems
2001
ISBN: 978-3-662-04616-6
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
E-Book, Englisch, 494 Seiten, eBook
Reihe: Texts in Theoretical Computer Science. An EATCS Series
ISBN: 978-3-662-04616-6
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
An introduction to the methods of designing algorithms for hard computing tasks, concentrating mainly on approximate, randomized, and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. This is the first book to systematically explain and compare all the main possibilities of attacking hard computing problems. It also closes the gap between theory and practice by providing at once a graduate textbook and a handbook for practitioners dealing with hard computing problems.
Zielgruppe
Professional/practitioner
Autoren/Hrsg.
Weitere Infos & Material
1 Introduction.- 2 Elementary Fundamentals.- 3 Deterministic Approaches.- 4 Approximation Algorithms.- 5 Randomized Algorithms.- 6 Heuristics.- 7 A Guide to Solving Hard Problems.- References.
