rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: CATBox
    sub title: An Interactive Course in Combinatorial Optimization
  name:
    name part: Hochstättler, Winfried.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Schliep, Alexander.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 190 p. 36 illus. online resource.
  abstract: 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/.
  table of contents: 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.
  note: by Winfried Hochstättler, Alexander Schliep.
  subject:
    topic: Mathematics
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Game theory
  subject:
    topic: Mathematical optimization
  subject:
    topic: Operations research
  subject:
    topic: Management science
  subject:
    topic: Discrete mathematics
  subject:
    topic: Combinatorics
  subject:
    topic: Mathematics
  subject:
    topic: Discrete Mathematics
  subject:
    topic: Game Theory, Economics, Social and Behav. Sciences
  subject:
    topic: Optimization
  subject:
    topic: Combinatorics
  subject:
    topic: Operations Research, Management Science
  subject:
    topic: Discrete Mathematics in Computer Science
  classification: QA150-272
  classification: 511.1
  related item:
    title info:
      title: Springer eBooks
  identifier: 9783642038228
  identifier: http://dx.doi.org/10.1007/978-3-642-03822-8
  record info:
    record creation date: 100318
    record change date: 20151204185145.0
    record identifier: 978-3-642-03822-8