{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:42:43Z","timestamp":1742960563005,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_17","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"198-209","source":"Crossref","is-referenced-by-count":24,"title":["The Travelling Salesman Problem in Bounded Degree Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[]},{"given":"Mikko","family":"Koivisto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bellman, R.: Combinatorial Processes and Dynamic Programming. In: Bellman, R., Hall Jr., M. (eds.) Proceedings of Symposia in Applied Mathematics. Combinatorial Analysis, vol.\u00a010, pp. 217\u2013249. American Mathematical Society (1960)","DOI":"10.1090\/psapm\/010\/0113718"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R. Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic Programming Treatment of the Travelling Salesman Problem. J.Assoc.Comput.Mach.\u00a09, 61\u201363 (1962)","journal-title":"J.Assoc.Comput.Mach."},{"key":"17_CR4","unstructured":"Bj\u00f6rklund, 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\u201396. IBFI Schloss Dagstuhl (2008)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"F.R.K. Chung","year":"1986","unstructured":"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\u00a043, 23\u201337 (1986)","journal-title":"J.Combinatorial Theory Ser.A"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.7155\/jgaa.00137","volume":"11","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D.: The Traveling Salesman Problem for Cubic Graphs. J.Graph Algorithms Appl.\u00a011, 61\u201381 (2007)","journal-title":"J.Graph Algorithms Appl."},{"key":"17_CR7","volume-title":"Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2008)","author":"H. Gebauer","year":"2008","unstructured":"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)"},{"volume-title":"The Traveling Salesman Problem and its Variations","year":"2002","key":"17_CR8","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A Dynamic Programming Approach to Sequencing Problems. J.Soc.Indust.Appl.Math.\u00a010, 196\u2013210 (1962)","journal-title":"J.Soc.Indust.Appl.Math."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-73545-8_13","volume-title":"Computing and Combinatorics","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Nakashima, T.: An Improved Exact Algorithm for Cubic Graph TSP. In: Lin, G. (ed.) COCOON. LNCS, vol.\u00a04598, pp. 108\u2013117. Springer, Heidelberg (2007)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic Programming Meets the Principle of Inclusion and Exclusion. Oper.Res.Lett.\u00a01, 49\u201351 (1982)","journal-title":"Oper.Res.Lett."},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/800179.810218","volume-title":"ACM Annual Conference (ACM 1977)","author":"S. Kohn","year":"1977","unstructured":"Kohn, S., Gottlieb, A., Kohn, M.: A Generating Function Approach to the Traveling Salesman Problem. In: ACM Annual Conference (ACM 1977), pp. 294\u2013300. ACM Press, New York (1977)"},{"volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985","key":"17_CR13","unstructured":"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)"},{"key":"17_CR14","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice\u2013Hall (2001)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact Algorithms for NP-Hard Problems: A Survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:24:58Z","timestamp":1714620298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}