69 citations · 80 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012
Online Mixed Packing and Covering
Umang Bhaskar, Lisa Fleischer
In many problems, the inputs arrive over time, and must be dealt with irrevocably when they arrive. Such problems are online problems. A common method of solving online problems is…
cs.DS2008★ 69 cited
Submodular approximation: sampling-based algorithms and lower bounds
Zoya Svitkina, Lisa Fleischer
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems in…