42 search results - page 4 / 9 » The Traveling Salesman Problem for Cubic Graphs |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
COR
2008
13 years 7 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
ESA
2003
Springer
14 years 18 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
FCS
2006
13 years 8 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...