Combinatorial Optimization: Networks and Matroids - Paperback
$17.99
$24.95
-28%Quantity
01
Pay over time for orders over $35.00 with
Offers & Perks
Earn 17 points with this purchase
Added to your rewards balance after checkout.
100 points welcome bonus
Create an account and start with extra points.
Availability:In StockContributor:Eugene LawlerSeries:Dover Books on MathematicsPublish date:2011-11-10Pages:384
Languages:EnglishPublisher:Dover PublicationsISBN-13:9780486414539ISBN-10:486414531UPC:9780486414539Book Category:MathematicsBook Subcategory:Combinatorics, Game TheorySize:8.48 x 5.36 x 0.76 inchesWeight:0.89Product ID:SCZP33EWS6
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.
Languages:EnglishPublisher:Dover PublicationsISBN-13:9780486414539ISBN-10:486414531UPC:9780486414539Book Category:MathematicsBook Subcategory:Combinatorics, Game TheorySize:8.48 x 5.36 x 0.76 inchesWeight:0.89Product ID:SCZP33EWS6
Free shipping on orders over $75. Standard shipping takes 3-7 business days. Eligible items may be returned within 30 days of delivery. Conditions apply.