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: 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: 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: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Combinatorial Optimization: Networks and Matroids. Book. Seller Inventory # BBS-9780486414539
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 439552
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
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780486414539
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # 6666-ING-9780486414539
Quantity: 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. reprint edition. 374 pages. 8.75x5.00x1.00 inches. In Stock. Seller Inventory # x-0486414531
Quantity: 2 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 439552-n
Quantity: Over 20 available