Bioinspired Computation in Combinatorial Optimization
Algorithms and Their Computational Complexity
- 228 pages
- 8 hours of reading
The book provides a rigorous approach to analyzing runtime behavior, specifically focusing on combinatorial optimization. It covers well-established problems in the field, including minimum spanning trees, shortest paths, maximum matching, as well as covering and scheduling issues, offering insights into their complexities and solutions.
