112 search results - page 4 / 23 » Labeled Traveling Salesman Problems: Complexity and approxim... |
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...
CCCG
2010
13 years 9 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...