{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:40Z","timestamp":1725521740512},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"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-92182-0_68","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"776-787","source":"Crossref","is-referenced-by-count":3,"title":["On Labeled Traveling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Basile","family":"Cou\u00ebtoux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orestis A.","family":"Telelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Albert, M., Frieze, A., Reed, B.: Multicoloured Hamilton Cycles. The Electronic Journal of Combinatorics, 2, R10 (1995)","DOI":"10.37236\/1204"},{"issue":"3","key":"68_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(02)00241-9","volume":"31","author":"T. Brueggemann","year":"2003","unstructured":"Brueggemann, T., Monnot, J., Woeginger, G.J.: Local search for the minimum label spanning tree problem with bounded color classes. Oper. Res. Lett.\u00a031(3), 195\u2013201 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"68_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H. Broersma","year":"1997","unstructured":"Broersma, H., Li, X.: Spanning Trees with Many or Few Colors in Edge-Colored Graphs. Discussiones Mathematicae Graph Theory\u00a017(2), 259\u2013269 (1997)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"68_CR4","first-page":"299","volume":"31","author":"H. Broersma","year":"2005","unstructured":"Broersma, H., Li, X., Woeginger, G.J., Zhang, S.: Paths and Cycles in Colored Graphs. Australasian Journal on Combinatorics\u00a031, 299\u2013311 (2005)","journal-title":"Australasian Journal on Combinatorics"},{"issue":"5","key":"68_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"R.-S. Chang","year":"1997","unstructured":"Chang, R.-S., Leu, S.-J.: The Minimum Labeling Spanning Trees. Inf. Process. Lett.\u00a063(5), 277\u2013282 (1997)","journal-title":"Inf. Process. Lett."},{"key":"68_CR6","unstructured":"Erd\u0151s, P., Nesetril, J., Roedl, V.: Some problems related to partitions of edges of a graph. In: Graphs and Other Combinatorial Topics, Teubner, Leipzig, pp. 54\u201363 (1983)"},{"key":"68_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(93)90054-W","volume":"118","author":"A.M. Frieze","year":"1993","unstructured":"Frieze, A.M., Reed, B.A.: Polychromatic Hamilton cycles. Discrete Mathematics\u00a0118, 69\u201374 (1993)","journal-title":"Discrete Mathematics"},{"key":"68_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"1","key":"68_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(86)90038-5","volume":"62","author":"G. Hahn","year":"1986","unstructured":"Hahn, G., Thomassen, C.: Path and cycle sub-Ramsey numbers and an edge-coloring conjecture. Discrete Mathematics\u00a062(1), 29\u201333 (1986)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"68_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10878-007-9044-x","volume":"14","author":"R. Hassin","year":"2007","unstructured":"Hassin, R., Monnot, J., Segev, D.: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. J. Comb. Opt.\u00a014(4), 437\u2013453 (2007)","journal-title":"J. Comb. Opt."},{"key":"68_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74839-7_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Hassin","year":"2007","unstructured":"Hassin, R., Monnot, J., Segev, D.: The Complexity of Bottleneck Labeled Graph Problems. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769. Springer, Heidelberg (2007)"},{"issue":"2","key":"68_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S.O. Krumke","year":"1998","unstructured":"Krumke, S.O., Wirth, H.-C.: On the Minimum Label Spanning Tree Problem. Inf. Process. Lett.\u00a066(2), 81\u201385 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"15","key":"68_CR13","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1016\/j.dam.2007.04.015","volume":"155","author":"F. Maffioli","year":"2007","unstructured":"Maffioli, F., Rizzi, R., Benati, S.: Least and most colored bases. Discrete Applied Mathematics\u00a0155(15), 1958\u20131970 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"68_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ipl.2005.06.009","volume":"96","author":"J. Monnot","year":"2005","unstructured":"Monnot, J.: The labeled perfect matching in bipartite graphs. Inf. Process. Lett.\u00a096(3), 81\u201388 (2005)","journal-title":"Inf. Process. Lett."},{"key":"68_CR15","doi-asserted-by":"crossref","unstructured":"Monnot, J.: A note on the hardness results for the labeled perfect matching problems in bipartite graphs. RAIRO-Operations Research (to appear, 2007)","DOI":"10.1051\/ro:2008020"},{"issue":"1","key":"68_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. of Operations Research\u00a018(1), 1\u201311 (1993)","journal-title":"Math. of Operations Research"},{"issue":"2","key":"68_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0167-6377(92)90069-F","volume":"12","author":"A.P. Punnen","year":"1992","unstructured":"Punnen, A.P.: Traveling Salesman Problem under Categorization. Oper. Res. Lett.\u00a012(2), 89\u201395 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"68_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0167-6377(93)90104-O","volume":"14","author":"A.P. Punnen","year":"1993","unstructured":"Punnen, A.P.: Erratum: Traveling Salesman Problem under Categorization. Oper. Res. Lett.\u00a014(2), 121 (1993)","journal-title":"Oper. Res. Lett."},{"key":"68_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-0-387-48793-9_8","volume-title":"Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies","author":"Y. Xiong","year":"2007","unstructured":"Xiong, Y., Golden, B., Wasil, E.: The Colorful Traveling Salesman Problem. In: Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies, pp. 115\u2013123. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T16:02:06Z","timestamp":1589385726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}