26 search results - page 5 / 6 » On Approximating Four Covering and Packing Problems |
PODC
2005
ACM
14 years 27 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
PODC
2005
ACM
14 years 27 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
MP
2007
13 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...