Surprise Castle
/Books
Combinatorial Optimization: Networks and Matroids

Combinatorial Optimization: Networks and Matroids - Paperback

by Eugene Lawler
$17.99
$24.95
-28%
Quantity
01

Pay over time for orders over $35.00 with

Availability:In StockContributor:Eugene LawlerSeries:Dover Books on MathematicsPublish date:2011-11-10Pages:384
Language:EnglishPublisher:Dover PublicationsISBN-13:9780486414539ISBN-10:486414531UPC:9780486414539Book Category:MathematicsBook Subcategory:Combinatorics, Game TheorySize:8.48 x 5.36 x 0.76 inchesWeight:0.8907Product 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.
Language:EnglishPublisher:Dover PublicationsISBN-13:9780486414539ISBN-10:486414531UPC:9780486414539Book Category:MathematicsBook Subcategory:Combinatorics, Game TheorySize:8.48 x 5.36 x 0.76 inchesWeight:0.8907Product ID:SCZP33EWS6
Publisher: Dover Publications

Contributor(s)

Eugene Lawler

Author

Eugene Lawler

Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.

Recently Viewed

View All