Robert E. Donovan
INTERSPEECH - Eurospeech 2001
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.
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Elliot Linzer, M. Vetterli
Computing
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008