Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
EUR 6,24
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
EUR 6,24
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.
Librería: MERS Goodwill, Saint Louis, MO, Estados Unidos de America
EUR 6,29
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
EUR 10,12
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
Librería: HPB-Diamond, Dallas, TX, Estados Unidos de America
EUR 11,03
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 15,73
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: INDOO, Avenel, NJ, Estados Unidos de America
EUR 18,07
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Brand New.
Idioma: Inglés
Publicado por Dover Publications 11/10/2011, 2011
ISBN 10: 0486414531 ISBN 13: 9780486414539
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 18,86
Cantidad disponible: 5 disponibles
Añadir al carritoPaperback or Softback. Condición: New. Combinatorial Optimization: Networks and Matroids. Book.
Librería: Lakeside Books, Benton Harbor, MI, Estados Unidos de America
EUR 16,30
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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!
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 17,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 22,85
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 22,91
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. reprint edition. 374 pages. 8.75x5.00x1.00 inches. In Stock.
Idioma: Inglés
Publicado por Dover Publications 2003-03-28, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Librería: Chiron Media, Wallingford, Reino Unido
EUR 20,54
Cantidad disponible: 20 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 23,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 24,59
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: moluna, Greven, Alemania
EUR 23,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: 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.
Idioma: Inglés
Publicado por Dover Publications Nov 2011, 2011
ISBN 10: 0486414531 ISBN 13: 9780486414539
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 27,92
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Idioma: Inglés
Publicado por Dover Publications Inc., 2011
ISBN 10: 0486414531 ISBN 13: 9780486414539
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 23,47
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 32,27
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Idioma: Inglés
Publicado por Dover Publications Inc., New York, 2003
ISBN 10: 0486414531 ISBN 13: 9780486414539
Librería: CitiRetail, Stevenage, Reino Unido
EUR 28,96
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.