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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0486414531I3N00
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Paperback. Etat : Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0486414531I5N00
Quantité disponible : 1 disponible(s)
Vendeur : MERS Goodwill, Saint Louis, MO, Etats-Unis
Etat : 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. N° de réf. du vendeur MERV.0486414531.A
Quantité disponible : 1 disponible(s)
Vendeur : World of Books (was SecondSale), Montgomery, IL, Etats-Unis
Etat : Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. N° de réf. du vendeur 00093475217
Quantité disponible : 1 disponible(s)
Vendeur : HPB-Diamond, Dallas, TX, Etats-Unis
Paperback. Etat : 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! N° de réf. du vendeur S_470407304
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 439552-n
Quantité disponible : Plus de 20 disponibles
Vendeur : INDOO, Avenel, NJ, Etats-Unis
Etat : New. Brand New. N° de réf. du vendeur 9780486414539
Quantité disponible : Plus de 20 disponibles
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
Paperback or Softback. Etat : New. Combinatorial Optimization: Networks and Matroids. Book. N° de réf. du vendeur BBS-9780486414539
Quantité disponible : 5 disponible(s)
Vendeur : Lakeside Books, Benton Harbor, MI, Etats-Unis
Etat : 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! N° de réf. du vendeur OTF-S-9780486414539
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 439552
Quantité disponible : Plus de 20 disponibles