2254 search results - page 37 / 451 » Computing the minimal covering set |
213
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
145
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
129
click to vote
DCG
1998
15 years 4 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
148
click to vote
CIE
2008
Springer
15 years 7 months ago
2008
Springer
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
140
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...