1298 search results - page 112 / 260 » The online set cover problem |
160
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulate...
183
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
208
click to vote
INFOCOM
2012
IEEE
13 years 9 months 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...
187
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
161
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...