676 search results - page 98 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
163
click to vote
EOR
2002
15 years 5 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
177
click to vote
JAR
2010
15 years 4 months ago
2010
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
165
click to vote
SIAMCO
2010
15 years 26 days ago
2010
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
143
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
189
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...