Combinatorial optimization
Subtitle: networks and matroids
By: Eugene L. Lawler.
Publisher: Holt, Rinehart and Winston
Published: 1976
Place of publication: New York
Language: eng
Number of pages: 374
Subjects: Combinatorial optimization; Matroids; Network analysis (Planning); Computational complexity; Algorithms
Description: 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.
Notes: Includes bibliographical references and indexes.