CATBox An Interactive Course in Combinatorial Optimization / by Winfried Hochstättler, Alexander Schliep.

Graph algorithms are easy to visualize and indeed there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, it can be difficult to understand the ideas behind the algorithm from the dynamic display alone...

Full description

Saved in:
Bibliographic Details
Main Authors: Hochstättler, Winfried (Author), Schliep, Alexander (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edition:1st ed. 2010.
Series:Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3285873
003 MWH
005 20191027192403.0
007 cr nn 008mamaa
008 100318s2010 gw | s |||| 0|eng d
020 |a 9783642038228 
024 7 |a 10.1007/978-3-642-03822-8  |2 doi 
035 |a (DE-He213)978-3-642-03822-8 
050 4 |a E-Book 
072 7 |a PBD  |2 bicssc 
072 7 |a MAT008000  |2 bisacsh 
072 7 |a PBD  |2 thema 
100 1 |a Hochstättler, Winfried.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a CATBox  |h [electronic resource] :  |b An Interactive Course in Combinatorial Optimization /  |c by Winfried Hochstättler, Alexander Schliep. 
250 |a 1st ed. 2010. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2010. 
300 |a XII, 190 p. 36 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer eBook Collection 
505 0 |a Discrete Problems from Applications -- Basics, Notation and Data Structures -- Minimum Spanning Trees -- Linear Programming Duality -- Shortest Paths -- Maximal Flows -- Minimum-Cost Flows -- Matching -- Weighted Matching. 
520 |a Graph algorithms are easy to visualize and indeed there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, it can be difficult to understand the ideas behind the algorithm from the dynamic display alone. CATBox consists of a software system for animating graph 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. He or she can set breakpoints, proceed in single steps and trace into subroutines. The graph, and additional auxiliary graphs like residual networks, are displayed and provide visual feedback. The course book, intended for readers at advanced undergraduate or graduate level, introduces the ideas and discusses the mathematical background necessary for understanding and verifying the correctness of the algorithms and their complexity. 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 as well as weighted and unweighted matchings both for bipartite and non-bipartite graphs. We consider non-bipartite weighted matching, in particular in the geometrical case, a highlight of combinatorial optimization. In order to enable the reader to fully enjoy the beauty of the primal-dual solution algorithm for weighted matching, we present all mathematical material not only from the point of view of graph theory, but also with an emphasis on linear programming and its duality. This yields insightful and aesthetically pleasing pictures for matchings, but also for minimum spanning trees. You can find more information at http://schliep.org/CATBox/. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Discrete mathematics. 
650 0 |a Game theory. 
650 0 |a Mathematical optimization. 
650 0 |a Combinatorics. 
650 0 |a Operations research. 
650 0 |a Management science. 
650 0 |a Computer science—Mathematics. 
690 |a Electronic resources (E-books) 
700 1 |a Schliep, Alexander.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-642-03822-8  |3 Click to view e-book  |t 0 
907 |a .b32858735  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21990359  |z 02-26-20 
999 f f |i 283fae5b-f478-52d1-8792-2e83758cd040  |s 8ecc8176-ce24-510e-a494-fa9e810b19c2  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File