529880
9780486414539
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.Lawler, Eugene is the author of 'Combinatorial Optimization Networks and Matroids' with ISBN 9780486414539 and ISBN 0486414531.
[read more]