676 search results - page 5 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
101
click to vote
IPL
2002
14 years 11 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
107
click to vote
CC
2010
Springer
14 years 9 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
DAGSTUHL
2004
15 years 1 months ago
2004
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...
101
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...