Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Paperback. Condizione: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.
Condizione: 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.
Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 15,78
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: INDOO, Avenel, NJ, U.S.A.
EUR 18,13
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Brand New.
Lingua: Inglese
Editore: Dover Publications 11/10/2011, 2011
ISBN 10: 0486414531 ISBN 13: 9780486414539
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condizione: New. Combinatorial Optimization: Networks and Matroids. Book.
Da: Lakeside Books, Benton Harbor, MI, U.S.A.
EUR 16,35
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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!
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 17,70
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: 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.
Da: Revaluation Books, Exeter, Regno Unito
EUR 22,87
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. reprint edition. 374 pages. 8.75x5.00x1.00 inches. In Stock.
Lingua: Inglese
Editore: Dover Publications 2003-03-28, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Da: Chiron Media, Wallingford, Regno Unito
EUR 20,51
Quantità: 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 23,41
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 24,58
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: moluna, Greven, Germania
EUR 23,64
Quantità: Più di 20 disponibili
Aggiungi al carrelloKartoniert / Broschiert. Condizione: New. InhaltsverzeichnisrnrnPrefacen Chapter 1 INTRODUCTIONn Chapter 2 MATHEMATICAL PRELIMINARIES nChapter 3 SHORTEST PATHS nChapter 4 NETWORK FLOWS n Chapter 5 BIPARTITE MATCHING nChapter 6 NONBIPARTITE MATCHING n Chapter 7 MATROIDS AND THE GR.
Lingua: Inglese
Editore: Dover Publications Nov 2011, 2011
ISBN 10: 0486414531 ISBN 13: 9780486414539
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 27,92
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware - 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.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 23,43
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Lingua: Inglese
Editore: Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 32,08
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Lingua: Inglese
Editore: Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Da: CitiRetail, Stevenage, Regno Unito
EUR 28,91
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.