• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Combinatorial Optimization: Networks and Matroids

Combinatorial Optimization: Networks and Matroids

Paperback

Series: Dover Books on Mathematics

General Mathematics

Publisher Price: $24.95

ISBN10: 0486414531
ISBN13: 9780486414539
Publisher: Dover Publications
Published: Nov 10 2011
Pages: 384
Weight: 0.89
Height: 0.76 Width: 5.36 Depth: 8.48
Language: English
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.

Also in

General Mathematics