Rolf Clauberg
IBM J. Res. Dev
Recent developments in the use of greedy algorithms in linear programming are reviewed and extended. We find a common generalization of some theorems of Queyranne-Spieksma-Tardella, Faigle-Kern, and Fujishige about greedy algorithms for linear programs in diverse contexts. Additionally, we extend a well-known theorem of Topkis about submodular functions on the product of chains to submodular functions on the product of lattices.
Rolf Clauberg
IBM J. Res. Dev
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Yao Qi, Raja Das, et al.
ISSTA 2009