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.
Shipping:
US$ 2.64
Within U.S.A.
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: New. Brand New. Seller Inventory # 9780486414539
Quantity: Over 20 available
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Combinatorial Optimization: Networks and Matroids 0.89. Book. Seller Inventory # BBS-9780486414539
Quantity: 5 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 439552-n
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 439552
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780486414539
Quantity: Over 20 available
Seller: Grand Eagle Retail, Fairfield, OH, 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
Quantity: 1 available
Seller: Russell Books, Victoria, BC, Canada
Paperback. Condition: New. Reprint. Special order direct from the distributor. Seller Inventory # ING9780486414539
Quantity: Over 20 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 400. Seller Inventory # 2654520087
Quantity: 1 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: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 437. Seller Inventory # C9780486414539
Quantity: Over 20 available