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.
"synopsis" may belong to another edition of this title.
Reprints a work originally published by Holt, Rinehart and Winston (New York, 1976). Focusing on combinatorial optimization problems involving matroids, this text is suitable for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. After introducing the basic mathematical princ
"About this title" may belong to another edition of this title.
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Paperback. Condition: As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0486414531I2N00
Seller: The Book Bin, Salem, OR, U.S.A.
paperback. Condition: Very Good. This book is from an inventory that we have been able to price inexpensively because it has minimal description. All of the books from this inventory are in very good condition or better, with the potential for light shelf-wear; many are particularly nice examples. May have a small remainder mark at textblock edge. Seller Inventory # WRM-B1005634
Seller: MERS Goodwill, Saint Louis, MO, U.S.A.
Condition: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Pages may include limited notes and highlighting, but the text cannot be obscured or unreadable. Any access codes or passwords originally included with the book may be expired, used or no longer valid. Image is stock photo and cover art edition may be different than pictured. Seller Inventory # MERV.0486414531.A
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 439552-n
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: New. Brand New. Seller Inventory # 9780486414539
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Combinatorial Optimization: Networks and Matroids. Book. Seller Inventory # BBS-9780486414539
Seller: Lakeside Books, Benton Harbor, MI, U.S.A.
Condition: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books! Seller Inventory # OTF-S-9780486414539
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 439552
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780486414539
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780486414539