557 search results - page 2 / 112 » On the set multi-cover problem in geometric settings |
COCOON
2010
Springer
13 years 9 months ago
2010
Springer
SODA
2012
ACM
11 years 7 months ago
2012
ACM
STOC
2010
ACM
13 years 10 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
TASE
2010
IEEE
13 years 17 hour ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...