Skip to main content alibris logo

Combinatorial Optimization: Networks and Matroids

by

Write The First Customer Review
Combinatorial Optimization: Networks and Matroids - Lawler, Eugene S, and Mathematics
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency

Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.

loading
Combinatorial Optimization: Networks and Matroids 2011, Dover Publications, Mineola, NY

ISBN-13: 9780486414539

Trade paperback

Combinatorial Optimization: Networks and Matroids 1995, Oxford University Press, USA, New York, NY

ISBN-13: 9780030848667

Hardcover