Tell your friends about this item:
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics) Reprint edition
Ordered from remote warehouse
Christmas presents can be returned until 31 January
Our customers say:
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
Mathematics
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.
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | November 10, 2011 |
| ISBN13 | 9780486414539 |
| Publishers | Dover Publications |
| Pages | 384 |
| Dimensions | 140 × 220 × 20 mm · 403 g |
| Language | English |
More by Mathematics
Show all
Others have also bought
See all of Mathematics ( e.g. Paperback Book , CD , Hardcover Book , 12" and LP )