Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
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.
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Thomas M. Cheng
IT Professional
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)