{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:48Z","timestamp":1747579548655},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_22","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"192-201","source":"Crossref","is-referenced-by-count":1,"title":["On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Baltz","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"Schoen","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"Angluin, D. Valiant, L.G.:Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comp. Sys. Sci. 18: (1979) 155\u2013194","journal-title":"J. Comp. Sys. Sci."},{"key":"22_CR2","unstructured":"Chalasani, P., Motwani, R., Rao, A.: Approximation Algorithms for Robot Grasp and Delivery. In: Proceedings 2nd International Workshop on Algorithmic Foundations of Robotics (WAFR). Toulouse, France (1996)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0097539792235384","volume":"24","author":"A. Frieze","year":"1995","unstructured":"Frieze, A., Karp, M., Reed, B.: When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. on Computing 24 (1995) 484\u2013493","journal-title":"SIAM J. on Computing"},{"key":"22_CR4","unstructured":"Frieze, A., Sorkin, G.B.: The probabilistic relationship between the assignment and asymmetric traveling salesman problems. In: Proceedings ACM-SIAM Symposium on Discrete Algorithms (SODA). Washington D.C. (2001) 652\u2013660"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.G. (editors): The Traveling Salesman Problem-A Guided Tour of Combinatorial Optimization. John Wiley & Sons (1985)","DOI":"10.1057\/jors.1986.117"},{"key":"22_CR6","unstructured":"Michel, C., Schroeter, H., Srivastav, A.: Approximation algorithms for pick-and-place robots. Preprint (2001)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1126\/science.251.4995.754","volume":"251","author":"D.L. Miller","year":"1991","unstructured":"Miller, D.L., Pekny, J.F.: Exact solution of large asymmetric traveling salesman problems. Science 251 (1991) 754\u2013762","journal-title":"Science"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","volume":"31","author":"D.W. Walkup","year":"1980","unstructured":"Walkup, D.W.: Matchings in random regular bipartite graphs. Discrete Mathematics 31 (1980) 59\u201364","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:26:35Z","timestamp":1556385995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}