CATBox An Interactive Course in Combinatorial Optimization /

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

Bibliographic Details
Call Number:Libro Electrónico
Main Authors: Hochstättler, Winfried (Author), Schliep, Alexander (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:Inglés
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edition:1st ed. 2010.
Subjects:
Discrete mathematics.
Game theory.
Mathematical optimization.
Operations research.
Management science.
Computer science > Mathematics.
Discrete Mathematics.
Game Theory.
Optimization.
Operations Research, Management Science .
Discrete Mathematics in Computer Science.
Online Access:Texto Completo
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.

Similar Items