Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
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.
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Yao Qi, Raja Das, et al.
ISSTA 2009
Liqun Chen, Matthias Enzmann, et al.
FC 2005