Combinatorial optimization
Status
Rate
Check Later
Product Links
Authors
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.
Reviews (0) see more
Seems like you haven't provided a review
Don't miss the opportunity to share your thoughts!