Combinatorial Optimization: Networks and Matroids

0 avg rating
( 0 ratings by Goodreads )
 
9780030848667: Combinatorial Optimization: Networks and Matroids

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.

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

Top Search Results from the AbeBooks Marketplace

1.

Lawler, Eugene L.
Published by Oxford University Press (1995)
ISBN 10: 0030848660 ISBN 13: 9780030848667
New Hardcover Quantity Available: 1
Seller:
Murray Media
(North Miami Beach, FL, U.S.A.)
Rating
[?]

Book Description Oxford University Press, 1995. Hardcover. Book Condition: New. Never used!. Bookseller Inventory # P110030848660

More Information About This Seller | Ask Bookseller a Question

Buy New
53.06
Convert Currency

Add to Basket

Shipping: 1.51
Within U.S.A.
Destination, Rates & Speeds

2.

Eugene L. Lawler
Published by Oxford University Press, USA (1995)
ISBN 10: 0030848660 ISBN 13: 9780030848667
New Hardcover Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Oxford University Press, USA, 1995. Hardcover. Book Condition: New. Bookseller Inventory # DADAX0030848660

More Information About This Seller | Ask Bookseller a Question

Buy New
134.55
Convert Currency

Add to Basket

Shipping: 3.03
Within U.S.A.
Destination, Rates & Speeds