Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Spese di spedizione:
EUR 3,73
In U.S.A.
Descrizione libro Condizione: New. Brand New. Codice articolo 0486414531
Descrizione libro Condizione: 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!. Codice articolo OTF-S-9780486414539
Descrizione libro Paperback or Softback. Condizione: New. Combinatorial Optimization: Networks and Matroids 0.89. Book. Codice articolo BBS-9780486414539
Descrizione libro Condizione: New. Codice articolo 439552-n
Descrizione libro Condizione: New. New! This book is in the same immaculate condition as when it was published. Codice articolo 353-0486414531-new
Descrizione libro Condizione: New. Codice articolo I-9780486414539
Descrizione libro Paperback. Condizione: New. Brand New! This item is printed on demand. Codice articolo 0486414531
Descrizione libro Paperback. Condizione: new. New. Fast Shipping and good customer service. Codice articolo Holz_New_0486414531
Descrizione libro Condizione: New. Buy with confidence! Book is in new, never-used condition. Codice articolo bk0486414531xvz189zvxnew
Descrizione libro 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. Codice articolo 9780486414539