Items related to Combinatorial Optimization: Networks and Matroids

Combinatorial Optimization: Networks and Matroids - Hardcover

Book 144 of 302: Dover Books on Mathematics

Lawler, Eugene

 
9780030848667: Combinatorial Optimization: Networks and Matroids

Synopsis

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.

"synopsis" may belong to another edition of this title.