D. De Werra, A.J. Hoffman, et al.
Discrete Applied Mathematics
Paper
On simple combinatorial optimization problems
Abstract
We characterize (0,1) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms. © 1992.
Related
R.L. Graham, A.J. Hoffman, et al.
Journal of Graph Theory
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
A.J. Hoffman, Basharat A. Jamil
Linear and Multilinear Algebra