511 search results - page 4 / 103 » TSP with bounded metrics |
TSP
2008
13 years 7 months ago
2008
In this paper, we consider the problem of estimating an unknown deterministic parameter vector in a linear regression model with random Gaussian uncertainty in the mixing matrix. W...
ORL
2008
13 years 6 months ago
2008
![Searching the k-change neighborhood for TSP is W[1]-hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Searching the k-change neighborhood for TSP is W[1]-hard")
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
LION
2009
Springer
14 years 1 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...