$8.73
Original: $24.95
-65%Combinatorial Optimization—
$24.95
$8.73The Story
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
Reprint of the Holt, Rinehart and Winston, New York, 1975 edition.
game theory; combinatorics; pure mathematics; certification; shortest paths; network flows; bipartite matching; non bipartite matching; matroids; greedy algorithm; matroid intersections; matroid parity problems; computer science; programming; concrete computational complexity; gale shapley matching; bidirected flows; cardinality matching algorithm; duality theory; science and math; optimization problems; matroids; algebraic structures; greedy algorithm; network flowsDescription
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
Reprint of the Holt, Rinehart and Winston, New York, 1975 edition.
game theory; combinatorics; pure mathematics; certification; shortest paths; network flows; bipartite matching; non bipartite matching; matroids; greedy algorithm; matroid intersections; matroid parity problems; computer science; programming; concrete computational complexity; gale shapley matching; bidirected flows; cardinality matching algorithm; duality theory; science and math; optimization problems; matroids; algebraic structures; greedy algorithm; network flows
