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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Paperback. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G0486414531I3N00
Cantidad disponible: 1 disponibles
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Paperback. Condición: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G0486414531I5N00
Cantidad disponible: 1 disponibles
Librería: MERS Goodwill, Saint Louis, MO, Estados Unidos de America
Condició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. Nº de ref. del artículo: MERV.0486414531.A
Cantidad disponible: 1 disponibles
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
Condición: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Nº de ref. del artículo: 00093475217
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 439552-n
Cantidad disponible: Más de 20 disponibles
Librería: INDOO, Avenel, NJ, Estados Unidos de America
Condición: New. Brand New. Nº de ref. del artículo: 9780486414539
Cantidad disponible: Más de 20 disponibles
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
Paperback or Softback. Condición: New. Combinatorial Optimization: Networks and Matroids. Book. Nº de ref. del artículo: BBS-9780486414539
Cantidad disponible: 5 disponibles
Librería: Lakeside Books, Benton Harbor, MI, Estados Unidos de America
Condició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! Nº de ref. del artículo: OTF-S-9780486414539
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 439552
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Paperback. 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. Nº de ref. del artículo: 9780486414539
Cantidad disponible: 1 disponibles