CATBox: an interactive course in combinatorial optimization

Graph algorithms are easy to visualize and indeed there already exists a variety of packages to animate the dynamics when solving problems from graph theory. Still it can be difficult to understand the ideas behind the algorithm fromthe dynamic display alone. CATBox consists of a software system for animatinggraph algorithms and a course book which we developed simultaneously. The software system presents both the algorithm and the graph and puts the user always in control of the actual code that is executed. In the course book, intendedfor readers at advanced undergraduate or graduate level, computer exercises and examples replace the usual static pictures of algorithm dynamics. For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows, weighted and unweighted matchings both for bipartite and non-bipartite graphs. Find more information at http://schliep.org/CATBox/. INDICE: 1 Discrete Problems from Applications.- 2 Basics, Notation and Data Structures.- 3 Minimum Spanning Trees.- 4 Linear Programming Duality.- 5 Shortest Paths.- 6 Maximal Flows.- 7 Minimum-cost Flows.- 8 Matching.- 9 WeightedMatching.- A. Using Gato and Gred.- B. A Brief Introduction to Reading Python.- C. Visualizing Graph Algorithms with Gato.- References.- Index.

• ISBN: 978-3-540-14887-6
• Editorial: Springer
• Encuadernacion: Rústica
• Páginas: 190
• Fecha Publicación: 19/11/2009
• Nº Volúmenes: 1
• Idioma: Inglés