Bestpeek.com logo
Sign In

Combinatorial Optimization : Networks and Matroids

Combinatorial Optimization : Networks and Matroids
Brand: Eugene S Lawler; Mathematics
(1)
1 stores
0 Products

Product Details

Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.

Dover Books on Mathematics: Combinatorial Optimization: Networks and Matroids (Paperback)

Shop Now

Compare Buying Options

Search
Amazon Amazon
Visit

Product Specifications

Technical Details

Manufacturer -
Brand Eugene S Lawler; Mathematics
Item model number -
Color -
Weight -
Height -
Depth -

Additional Product Information

Product Id 533076
User Reviews and Ratings
3 (1 ratings)
3 out of 5 stars
UPC 800759414536

Shopping Options

Compare Buying Options

# Shop & Price
1
Check on Amazon
Price:
Search Visit Amazon

Top User Reviews and Ratings

No reviews available yet.

Be the first to review this product!