Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Preface Chapter 1 INTRODUCTION Chapter 2 MATHEMATICAL PRELIMINARIES Chapter 3 SHORTEST PATHS Chapter 4 NETWORK FLOWS Chapter 5 BIPARTITE MATCHING Chapter 6 NONBIPARTITE MATCHING Chapter 7 MATROIDS AND THE GREEDY ALGORITHM Chapter 8 MATROID INTERSECTIONS Chapter 9 THE MATROID PARITY PROBLEM Author Index Subject Index
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condizione: Very Good. Reprint. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Codice articolo 0486414531-11-1
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 439552-n
Quantità: Più di 20 disponibili
Da: INDOO, Avenel, NJ, U.S.A.
Condizione: New. Brand New. Codice articolo 9780486414539
Quantità: Più di 20 disponibili
Da: Lakeside Books, Benton Harbor, MI, U.S.A.
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
Quantità: Più di 20 disponibili
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condizione: New. Combinatorial Optimization: Networks and Matroids. Book. Codice articolo BBS-9780486414539
Quantità: 5 disponibili
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. Codice articolo 9780486414539
Quantità: 1 disponibili
Da: WeBuyBooks, Rossendale, LANCS, Regno Unito
paperback. Condizione: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind. Codice articolo rev4862917818
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780486414539
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 439552
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Codice articolo 6666-ING-9780486414539
Quantità: 20 disponibili