3875 search results - page 273 / 775 » Approximation algorithms for the 0-extension problem |
163
click to vote
FUIN
2010
15 years 4 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
177
click to vote
SSDBM
2003
IEEE
16 years 2 hour ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
152
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
173
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...