2496 search results - page 191 / 500 » On covering by translates of a set |
219
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
211
click to vote
ALGOSENSORS
2007
Springer
15 years 10 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
193
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
206
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
159
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...