Algorithmics for Hard Computing Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

Juraj Hromkovic

ISBN 10: 3540668608 / ISBN 13: 9783540668602

Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2001

Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2001. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 2001. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-812-953

Riassunto:

This textbook is an introduction to the methods of designing algorithms for hard computing tasks. This area has developed dynamically and is one of the kernels of research in algorithm and complexity theory. The book mainly concentrates on approximate, randomized and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. There exist several monographs specializing in some of these methods, but this book systematically explains and compares all main possibilities of attacking hard computing problems. Since the topic is fundamental for the university study in computer science and essential for the transfer of theoretical knowledge to the practice, the book tries to close this gap by providing at once a textbook for graduate students and a handbook for practitioners dealing with hard computing problems.

Dalla quarta di copertina: This book is an introduction to the methods of designing algorithms for hard computing tasks. This area has developed very dynamically in the last years and is one of the kernels of current research in algorithm and complexity theory.
The book mainly concentrates on approximate, randomized and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. There exist several monographs specializing in some of these methods, but no book systematically explains and compares all main possibilities of attacking hard computing problems. Since the topic is fundamental for the university study in computer science and essential for the transfer of formal methods to the practice, the aim of the book is to close this gap by providing at once a textbook for graduate students and a handbook for practitioners dealing with hard computing problems.

Dati bibliografici

Titolo: Algorithmics for Hard Computing Problems: ...
Casa editrice: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Data di pubblicazione: 2001
Legatura: Hardcover
Condizione: Très bon