Dover Publications
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
Free shipping with 3 or more products in your cart
Payflex: Pay in 4 interest-free payments of R327.25. Read the FAQ
R 1,769
26% off
Limited time offer
R 1,309
In stock
Low stock in USA warehouse Order soon to secure your order
Duties, insurance and VAT included
Delivered in 10–20 working days —
Free shipping with 3 or more products in your cart
Secure checkout
Your payment is fully protected
Duties & VAT included
No surprise charges at the door
Tracked delivery
Track your order end to end
Returns support
30-day return window
Description
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.
Shipping & Delivery
Your order is shipped from the USA and delivered to your door in South Africa in 10–20 working days. All items are fully tracked.
Returns & Exchanges
We offer a 30-day return window. If something isn't right, contact our support team and we'll make it right.