Combinatorial Optimization: Networks and Matroids - Softcover

Book 144 of 302: Dover Books on Mathematics

Lawler, Eugene

 
9780486414539: 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.

Synopsis

Reprints a work originally published by Holt, Rinehart and Winston (New York, 1976). Focusing on combinatorial optimization problems involving matroids, this text is suitable for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. After introducing the basic mathematical princ

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

Other Popular Editions of the Same Title