Combinatorial Optimization
Networks and Matroids| By: | Eugene Lawler |
| Publisher: | Dover Publications |
| Print ISBN: | 9780486414539 |
| eText ISBN: | 9780486143668 |
| Edition: | 0 |
| Format: | Reflowable |
Lifetime - $29.94
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
Details
Table of Contents
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.