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
Is a well-known author, some of his books are a fascination for readers like in the Combinatorial Optimization: Networks and Matroids book, this is one of the most wanted Eugene Lawler author readers around the world.
- 384 pages
- Combinatorial Optimization: Networks and Matroids
- Eugene Lawler
- 13 October 2017 Eugene Lawler