Combinatorial Optimization: Networks and Matroids

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 and concrete computational complexity in departments of computer science and mathematics.

Author: Eugene S. Lawler, Mathematics
Publisher: Dover Publications
Published: 11/10/2011
Pages: 384
Binding Type: Paperback
Weight: 0.89lbs
Size: 8.48h x 5.36w x 0.76d
ISBN: 9780486414539

This title is not returnable