Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

Autori

• Frank Neumann
• Carsten Witt

Parametri

Pagine

228pagine

Tempo di lettura

8ore

• Computer, IT, programmazione

Maggiori informazioni sul libro

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.

Per saperne di più

Lingua: Inglese

Pubblicato: 2013

(In brossura)