{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:12:29Z","timestamp":1758892349232},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662557501"},{"type":"electronic","value":"9783662557518"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_7","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T15:32:49Z","timestamp":1502811169000},"page":"69-81","source":"Crossref","is-referenced-by-count":6,"title":["New Results on Routing via Matchings on\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Indranil","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Richards","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N Alon","year":"1994","unstructured":"Alon, N., Chung, F.R., Graham, R.L.: Routing permutations on graphs via matchings. SIAM J. Discrete Math. 7(3), 513\u2013530 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR2","first-page":"1","volume":"18","author":"A Gy\u00e1rf\u00e1s","year":"2011","unstructured":"Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M., S\u00e1rk\u00f6zy, G., Szemer\u00e9di, E.: Partitioning 3-colored complete graphs into three monochromatic cycles. Electronic J. Comb. 18, 1\u201316 (2011)","journal-title":"Electronic J. Comb."},{"issue":"2","key":"7_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. J. ACM (JACM) 43(2), 268\u2013292 (1996)","journal-title":"J. ACM (JACM)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53925-6_35","volume-title":"WALCOM: Algorithms and Computation.","author":"J Kawahara","year":"2017","unstructured":"Kawahara, J., Saitoh, T., Yoshinaka, R.: The time complexity of the token swapping problem and its parallel variants. In: Poon, S.-H., Rahman, Md, Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167. Springer, Cham (2017). doi: 10.1007\/978-3-319-53925-6_35"},{"issue":"1","key":"7_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480197323159","volume":"12","author":"L Zhang","year":"1999","unstructured":"Zhang, L.: Optimal bounds for matching routing on trees. SIAM J. Discrete Math. 12(1), 64\u201377 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"7_CR6","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1137\/090776317","volume":"24","author":"WT Li","year":"2010","unstructured":"Li, W.T., Lu, L., Yang, Y.: Routing numbers of cycles, complete bipartite graphs, and hypercubes. SIAM J. Discrete Math. 24(4), 1482\u20131494 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $$O (\\sqrt{|V|}|E|)$$ algoithm for finding maximum matching in general graphs. In: 1980 21st Annual Symposium on Foundations of Computer Science, pp. 17\u201327. IEEE, October 1980","DOI":"10.1109\/SFCS.1980.12"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Yamanaka, K., Demaine, E.D., Ito, T., Kawahara, J., Kiyomi, M., Okamoto, Y., Toshiki, S., Akira, S., Kei, U., Uno, T.: Swapping labeled tokens on graphs. In: Theoretical Computer Science, vol. 586, pp. 81\u201394 (2015). Computer programming: sorting and searching (Vol. 3). Pearson Education","DOI":"10.1016\/j.tcs.2015.01.052"},{"key":"7_CR9","unstructured":"Miltzow, T., Narins, L., Okamoto, Y., Rote, G., Thomas, A., Uno, T.: Approximation and hardness for token swapping. arXiv preprint arXiv:1602.05150 (2016)"},{"key":"7_CR10","volume-title":"Combinatorial Theory","author":"M Hall","year":"1998","unstructured":"Hall, M.: Combinatorial Theory, vol. 71. Wiley, Hoboken (1998)"},{"issue":"3","key":"7_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","volume":"2","author":"S Even","year":"1981","unstructured":"Even, S., Goldreich, O.: The minimum-length generator sequence problem is NP-hard. J. Algorithms 2(3), 311\u2013313 (1981)","journal-title":"J. Algorithms"},{"issue":"2","key":"7_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U Feige","year":"2004","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discrete Math. 18(2), 219\u2013225 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"7_CR13","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R Boppana","year":"1992","unstructured":"Boppana, R., Halldrsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT Numer. Math. 32(2), 180\u2013196 (1992)","journal-title":"BIT Numer. Math."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45022-X_2","volume-title":"Automata, Languages and Programming","author":"L Engebretsen","year":"2000","unstructured":"Engebretsen, L., Holmerin, J.: Clique is hard to approximate within n 1-o(1). In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 2\u201312. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45022-X_2"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"MR Jerrum","year":"1985","unstructured":"Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theor. Comput. Sci. 36, 265\u2013289 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Banerjee, I., Richards, D.: Routing and sorting via matchings on graphs. arXiv preprint arXiv:1604.04978 (2016)","DOI":"10.1007\/978-3-662-55751-8_7"},{"issue":"2","key":"7_CR17","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1137\/130930078","volume":"28","author":"I Benjamini","year":"2014","unstructured":"Benjamini, I., Shinkar, I., Tsur, G.: Acquaintance time of a graph. SIAM J. Discrete Math. 28(2), 767\u2013785 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Banerjee, I., Richards, D.: New results on routing via matchings on graphs. arXiv preprint arXiv:1706.09355 (2017)","DOI":"10.1007\/978-3-662-55751-8_7"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T06:01:45Z","timestamp":1659333705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}