David S. Kung
DAC 1998
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.
David S. Kung
DAC 1998
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004