Ebook: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Author: Juraj Hromkovič
- Genre: Mathematics // Algorithms and Data Structures
- Tags: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, Artificial Intelligence (incl. Robotics), Computational Mathematics and Numerical Analysis, Combinatorics, Complexity
- Series: Texts in Theoretical Computer Science. An EATCS Series
- Year: 2001
- Publisher: Springer
- Edition: 1st
- Language: English
- pdf
Content:
Front Matter....Pages I-XI
Introduction....Pages 1-9
Elementary Fundamentals....Pages 11-142
Deterministic Approaches....Pages 143-212
Approximation Algorithms....Pages 213-305
Randomized Algorithms....Pages 307-385
Heuristics....Pages 387-415
A Guide to Solving Hard Problems....Pages 417-457
Back Matter....Pages 459-494
Content:
Front Matter....Pages I-XI
Introduction....Pages 1-9
Elementary Fundamentals....Pages 11-142
Deterministic Approaches....Pages 143-212
Approximation Algorithms....Pages 213-305
Randomized Algorithms....Pages 307-385
Heuristics....Pages 387-415
A Guide to Solving Hard Problems....Pages 417-457
Back Matter....Pages 459-494
....
Download the book Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)