An improved exact algorithm for cubic graph TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4598 LNCS, Issue , 2007, Pages 108-117

  Iwama, Kazuo ^a   Nakashima, Takuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; PROBLEM SOLVING;

CUBIC GRAPH;

TRAVELING SALESMAN PROBLEM;

EID: 37849040832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_13     Document Type: Conference Paper

References (9)

1. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. SIAM Journal on Applied Mathematics 10, 196-210 (1962)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman (1979)
3. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36, 177-189 (1979)
4. Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM Journal on Computing 9, 615-627 (1980)
5. Hwang, R.Z., Chang, R.C., Lee, R.C.T.: The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. Algorithmica 9, 398-423 (1993)
6. Iwama, K., Tamaki, S.: Improved Upper Bounds for 3-SAT, 15th annual ACM-SIAM Symposium on Discrete Algorithms. In: Proc. SODA, January 2004, pp. 328-329 (2004)
7. Woeginger, G.J.: Exact Algorithms for NP-Hard Problems: A Survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185-207. Springer, Heidelberg (2003)
8. Eppstein, D.: The Traveling Salesman Problem for Cubic Graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 307-318. Springer, Heidelberg (2003)
9. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient Exact Algorithms on Planar Graphs:Exploiting Sphere Cut Branch Decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95-106. Springer, Heidelberg (2005)