676 search results - page 1 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
CORR
2012
Springer
12 years 7 days ago
2012
Springer
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
TSP
2010
12 years 11 months ago
2010
We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cram
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...