Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

Auteurs

• Frank Neumann
• Carsten Witt

Paramètres

• Pages: 228 pages
• Temps de lecture: 8 heures

• Informatique, programmation

En savoir plus sur le livre

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.

Achat du livre

• Année de publication: 2013
• Reliure: (souple)