16404 search results - page 362 / 3281 » A set coverage problem |
116
click to vote
DM
2002
15 years 4 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
165
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
144
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
131
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
131
Voted
FAW
2008
Springer
15 years 6 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...