- Vendor: Mia Karts
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
Free U.S. shipping on all orders. Free international shipping on orders over $99
All orders are dispatched the next business day!
Competitive Pricing You Can Trust — Quality You Can Rely On.
ISBN: 0486414531
Author: Lawler, Eugene
Condition: New
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.
Have a question?
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
You May Also Like
More in Mathematics
