Alan J. Hoffman
Advances in Computational Mathematics
Paper
On greedy algorithms for series parallel graphs
Abstract
This note describes some sufficient conditions for the maximum or minimum of a weighted flow (the weights are on paths, and are derived from weights on the edges of the path), of given volume in a series parallel graph to be found by a greedy algorithm. © 1988 The Mathematical Programming Society, Inc.
Related
Don Coppersmith, Alan J. Hoffman, et al.
Linear Algebra and Its Applications
Paul Erdös, Siemion Fajtlowicz, et al.
Networks
Wolfgang W. Bein, Peter Brucker, et al.
Mathematical Programming