𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

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

✍ Scribed by Juraj Hromkovič

Publisher
Springer
Year
2001
Tongue
English
Leaves
506
Series
Texts in Theoretical Computer Science. An EATCS Series
Edition
1st
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithmics for Hard Problems: Introduc
πŸ“ Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
✍ Juraj Hromkovič πŸ“‚ Library πŸ“… 2004 πŸ› Springer 🌐 English

<P>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 he

Algorithmics for Hard Problems: Introduc
πŸ“ Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
✍ Juraj Hromkovič πŸ“‚ Library πŸ“… 2001 πŸ› Springer 🌐 English

This textbook provides a "cheap ticket" to the design of algorithms for hard computing problems, Le., for problems for which no low-degree polynomial-time algorithms1 are known. It focuses on a systematic presentation of the fundamental concepts and algorithm design techniques. The presentation