Sciweavers

9572 search results - page 31 / 1915
» Cover Algorithms and Their Combination
Sort
View
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
14 years 1 months ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 11 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 7 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
ISAAC
2005
Springer
107views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Minimizing a Monotone Concave Function with Laminar Covering Constraints
Mariko Sakashita, Kazuhisa Makino, Satoru Fujishig...