| 000 -LEADER |
|---|
| fixed length control field |
03813nam a22004935i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151454.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
100318s2010 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642038228 |
|
978-3-642-03822-8 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA164-167.2 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.6 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
Berlin, Heidelberg : |
| -- |
Springer Berlin Heidelberg, |
| -- |
2010. |
| 912 ## - |
|---|
| -- |
ZDB-2-SMA |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Hochstättler, Winfried. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
CATBox |
| Medium |
[electronic resource] : |
| Remainder of title |
An Interactive Course in Combinatorial Optimization / |
| Statement of responsibility, etc |
by Winfried Hochstättler, Alexander Schliep. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XII, 190p. 36 illus. |
| Other physical details |
online resource. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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/. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Computational complexity. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Mathematical optimization. |
|
|---|
| Topical term or geographic name as entry element |
Operations research. |
|
|---|
| Topical term or geographic name as entry element |
Economics, Mathematical. |
|
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Optimization. |
|
|---|
| Topical term or geographic name as entry element |
Operations Research, Mathematical Programming. |
|
|---|
| Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Game Theory/Mathematical Methods. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Schliep, Alexander. |
| Relator term |
author. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9783540148876 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-03822-8 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
