4843 search results - page 160 / 969 » The Shortcut Problem - Complexity and Approximation |
143
click to vote
APPROX
2008
Springer
15 years 5 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...
153
click to vote
CORR
2011
Springer
14 years 9 months 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 ...
181
click to vote
FOGA
2011
14 years 6 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...
124
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
124
click to vote
FOCS
2008
IEEE
15 years 9 months 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 ...