An edition of Combinatorial optimization (1975)
Combinatorial optimization
networks and matroids
By Eugene L. Lawler
0 (0 Ratings)
1 Want to read0 Currently reading0 Have read
1 Want to read0 Currently reading0 Have read
Publish Date
2001
Publisher
Dover Publications
Language
eng
Pages
379
Description:
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.