عنوان

Algorithmics for hard problems :

شابک

3662046164

شابک

3662046180

شابک

9783662046166

شابک

9783662046180

شماره

b579355

عنوان اصلي

Algorithmics for hard problems :

نام عام مواد

[Book]

ساير اطلاعات عنواني

introduction to combinatorial optimization, randomization, approximation, and heuristics

نام نخستين پديدآور

Jurai Hromkovič.

محل نشرو پخش و غیره

Berlin ; New York

نام ناشر، پخش کننده و غيره

Springer

تاریخ نشرو بخش و غیره

©2001.

نام خاص و کميت اثر

(xi, 492 pages) : illustrations

عنوان فروست

Texts in theoretical computer science.

متن يادداشت

1 Introduction --; 2 Elementary Fundamentals --; 3 Deterministic Approaches --; 4 Approximation Algorithms --; 5 Randomized Algorithms --; 6 Heuristics --; 7 A Guide to Solving Hard Problems --; References.

متن يادداشت

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.

موضوع مستند نشده

Algorithmes.

موضوع مستند نشده

Computer algorithms.

موضوع مستند نشده

Problem solving -- Data processing.

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Jurai Hromkovič.

مستند نام اشخاص تاييد نشده

Juraj Hromkovič

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y