599 search results - page 26 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
DATE
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
102
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
106
click to vote
FTTCS
2006
14 years 11 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...