Introduction to tractability and approxi
β Chen J.
π Library
π
2001
π TAMU
π English
β¦ LIBER β¦
π
Introduction to Tractability and Approximability of Optimization Problems
β Scribed by Chen J.
- Year
- 2001
- Tongue
- English
- Leaves
- 397
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Tractability and approximability of opti
β Chen J.
π Library
π
2003
π English
Algorithmics for Hard Problems: Introduc
β 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
β 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
Algorithmics for hard problems: introduc
β HromkoviΔ, Juraj
π Library
π
2011
π Springer
π English
Algorithmics for Hard Problems: Introduc
β Juraj HromkoviΔ
π Library
π
2001
π Springer
π English