4894 search results - page 254 / 979 » The Guarding Problem - Complexity and Approximation |
173
click to vote
COLOGNETWENTE
2008
15 years 8 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
148
click to vote
SIAMCO
2000
15 years 6 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
175
click to vote
MCS
2008
Springer
15 years 6 months ago
2008
Springer
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
186
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
179
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...