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.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

BGV Books LLC
404 Industrial Rd, Murray, KY, 42071, U.S.A.

Sale & Shipping Terms

Terms of Sale

Shipping Terms

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	5 to 8 business days	3 to 6 business days
First item	US$ 0.00	US$ 3.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.