1272 search results - page 101 / 255 » The Set Cover with Pairs Problem |
113
click to vote
COMPGEOM
2010
ACM
15 years 5 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 ...
83
Voted
PODS
2006
ACM
16 years 28 days ago
2006
ACM
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
204
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
SODA
2004
ACM
15 years 2 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)...
94
Voted
PPL
2008
15 years 22 days ago
2008
This discussion paper explores the problems of operating systems support when implementing concurrency controls at the level of the instruction set in processors designed for mult...