1110 search results - page 84 / 222 » New Approximation Results for Resource Replication Problems |
117
click to vote
FOCS
2005
IEEE
15 years 4 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
DCOSS
2009
Springer
15 years 5 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
SAC
2002
ACM
14 years 10 months ago
2002
ACM
A multi-agent system architecture for coordination of just-in-time production and distribution is presented. The problem to solve is two-fold: first the right amount of resources ...
114
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
CP
2006
Springer
15 years 2 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...