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.

ISBN

Page Number

Author

Publisher

Awaiting product image
Combinational Optimization (Dover Books on Mathematics)
Original price was: $121.00.Current price is: $10.00.

In stock