Reprints a work originally published by Holt, Rinehart and Winston (New York, 1976). Focusing on combinatorial optimization problems involving matroids, this text is suitable for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. After introducing the basic mathematical principles involved, the book examines shortest paths, network flows, and bipartite matching. It then goes on to discuss non-bipartite matching, the greedy algorithm, matroid intersections, and the matroid parity problem. Annotation c. Book News, Inc., Portland, OR (booknews.com)
