1040 search results - page 155 / 208 » Rounding algorithms for covering problems |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
110
click to vote
SIGIR
2003
ACM
15 years 3 months ago
2003
ACM
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...
114
click to vote
INFOCOM
2012
IEEE
13 years 5 days ago
2012
IEEE
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...