9780486414539
Combinatorial Optimization: Networks And Matroids - Eugene Lawler
Dover Publications (2001)
In Collection
#2831

Read It:
Yes
Combinatorial optimization, Matroids, Network analysis (Planning), Computational complexity, Algorithms

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.

Product Details
LoC Classification QA402.5 .L39 2001
Dewey 519.3
Format Paperback
Cover Price 15,95 €
No. of Pages 374
Height x Width 220 x 135 mm
Personal Details
Links Amazon
Library of Congress