BooksCloudSKU: 9780486414539
Combinatorial Optimization: Networks and Matroids - Paperback
$33.95
/
Shipping calculated at checkout.
In stock (50)
$33.95
Combinatorial Optimization: Networks and Matroids - Paperback
$33.95
/
Combinatorial Optimization: Networks and Matroids - Paperback
$33.95
/
products.product.pickup_availability.unavailable
Still deciding?
Payment & Security
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
Security
Related categories
High-Quality MaterialsMade with premium materials for long-lasting use.
Easy to UseSimple design for quick setup and convenience.
Versatile & Multi-PurposePerfect for home, office, or on-the-go.
Satisfaction GuaranteeLove it or return it for a full refund.
by Eugene Lawler (Author)
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.
Number of Pages: 384
Dimensions: 0.76 x 8.48 x 5.36 IN
Publication Date: November 10, 2011
Free shipping on all U.S. orders
Easy returns and exchanges
30 day money back guarantee
