Algorithmics for Hard Problems [electronic resource] : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics / by Juraj Hromkovič.

Author
Hromkovič, Juraj [Browse]
Format
Book
Language
English
Εdition
1st ed. 2001.
Published/​Created
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
Description
1 online resource (XI, 494 p.)

Details

Subject(s)
Series
Summary note
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.
Notes
Bibliographic Level Mode of Issuance: Monograph
Bibliographic references
Includes bibliographical references and index.
Language note
English
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.
ISBN
3-662-04616-4
Doi
  • 10.1007/978-3-662-04616-6
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...
Other views
Staff view