Bookbot

Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

Book rating

3.0(1)Add rating

Parameters

Pages
228 pages
Reading time
8 hours

More about the book

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.

Publication

Book purchase

Bioinspired Computation in Combinatorial Optimization, Frank Neumann, Carsten Witt

Language
Released
2013
product-detail.submit-box.info.binding
(Paperback)
We’ll email you as soon as we track it down.

Payment methods

3.0
Okay
1 Ratings

We’re missing your review here.