رکورد قبلیرکورد بعدی

" Algorithmics for hard problems : "


Document Type : BL
Record Number : 759384
Doc. No : b579355
Main Entry : Jurai Hromkovič.
Title & Author : Algorithmics for hard problems : : introduction to combinatorial optimization, randomization, approximation, and heuristics\ Jurai Hromkovič.
Publication Statement : Berlin ; New York : Springer, ©2001.
Series Statement : Texts in theoretical computer science.
Page. NO : (xi, 492 pages) : illustrations
ISBN : 3662046164
: : 3662046180
: : 9783662046166
: : 9783662046180
Contents : 1 Introduction --; 2 Elementary Fundamentals --; 3 Deterministic Approaches --; 4 Approximation Algorithms --; 5 Randomized Algorithms --; 6 Heuristics --; 7 A Guide to Solving Hard Problems --; References.
Abstract : 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.
Subject : Algorithmes.
Subject : Computer algorithms.
Subject : Problem solving -- Data processing.
LC Classification : ‭QA76.9.A43‬‭J873 2001‬
Added Entry : Juraj Hromkovič
کپی لینک

پیشنهاد خرید
پیوستها
Search result is zero
نظرسنجی
نظرسنجی منابع دیجیتال

1 - آیا از کیفیت منابع دیجیتال راضی هستید؟