511 search results - page 3 / 103 » TSP with bounded metrics |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
TSP
2008
13 years 5 months ago
2008
Minimal bounds on the mean square error (MSE) are generally used in order to predict the best achievable performance of an estimator for a given observation model. In this paper, w...
TSP
2010
13 years 16 hour 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
AOR
2006
13 years 5 months ago
2006
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A pro...