The travelling salesman problem in bounded degree graphs

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 198-209

  Björklund, Andreas ^a   Husfeldt, Thore ^a   Kaski, Petteri ^b   Koivisto, Mikko ^b  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; TRANSLATION (LANGUAGES);

BOUNDED DEGREE GRAPHS; DEGREE GRAPHS; TRAVELLING SALESMAN PROBLEM;

LINGUISTICS;

EID: 49049114076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_17     Document Type: Conference Paper

References (15)

1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
2. Bellman, R.: Combinatorial Processes and Dynamic Programming. In: Bellman, R., Hall Jr., M. (eds.) Proceedings of Symposia in Applied Mathematics. Combinatorial Analysis, vol. 10, pp. 217-249. American Mathematical Society (1960)
3. Bellman, R.: Dynamic Programming Treatment of the Travelling Salesman Problem. J.Assoc.Comput.Mach. 9, 61-63 (1962)
4. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Moebius Inversion and Graphs of Bounded Degree. In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). Dagstuhl Seminar Proceedings 08001, pp. 85-96. IBFI Schloss Dagstuhl (2008)
5. Chung, F.R.K., Frankl, P., Graham, R.L., Shearer, J.B.: Some Intersection Theorems for Ordered Sets and Graphs. J.Combinatorial Theory Ser.A 43, 23-37 (1986)
6. Eppstein, D.: The Traveling Salesman Problem for Cubic Graphs. J.Graph Algorithms Appl. 11, 61-81 (2007)
7. Gebauer, H.: On the Number of Hamilton Cycles in Bounded Degree Graphs. In: Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2008). SIAM, Philadelphia (2008)
8. Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)
9. Held, M., Karp, R.M.: A Dynamic Programming Approach to Sequencing Problems. J.Soc.Indust.Appl.Math. 10, 196-210 (1962)
10. Iwama, K., Nakashima, T.: An Improved Exact Algorithm for Cubic Graph TSP. In: Lin, G. (ed.) COCOON. LNCS, vol. 4598, pp. 108-117. Springer, Heidelberg (2007)
11. Karp, R.M.: Dynamic Programming Meets the Principle of Inclusion and Exclusion. Oper.Res.Lett. 1, 49-51 (1982)
12. Kohn, S., Gottlieb, A., Kohn, M.: A Generating Function Approach to the Traveling Salesman Problem. In: ACM Annual Conference (ACM 1977), pp. 294-300. ACM Press, New York (1977)
13. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)
14. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall (2001)
15. 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)