4894 search results - page 167 / 979 » The Guarding Problem - Complexity and Approximation |
192
click to vote
DCOSS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
189
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
204
click to vote
CORR
2011
Springer
15 years 29 days ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
229
click to vote
FOGA
2011
14 years 10 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
167
click to vote
FOCS
2008
IEEE
16 years 28 days ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...