{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:00:05Z","timestamp":1743058805312,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_25","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"310-323","source":"Crossref","is-referenced-by-count":2,"title":["A New View on Rural Postman Based on Eulerian Extension and Matching"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Sorge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"van Bevern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Assad, A.A., Golden, B.L.: Arc routing methods and applications. In: Network Routing. Handbooks in Operations Research and Management Science, vol.\u00a08, pp. 375\u2013483. Elsevier B.V. (1995)","DOI":"10.1016\/S0927-0507(05)80109-4"},{"issue":"12","key":"25_CR2","doi-asserted-by":"publisher","first-page":"3111","DOI":"10.1016\/j.cor.2004.04.007","volume":"32","author":"E. Benavent","year":"2005","unstructured":"Benavent, E., Corber\u00e1n, A., Pi\u00f1ana, E., Plana, I., Sanchis, J.M.: New heuristic algorithms for the windy rural postman problem. Comput. Oper. Res.\u00a032(12), 3111\u20133128 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S0377-2217(02)00813-5","volume":"155","author":"E.A. Cabral","year":"2004","unstructured":"Cabral, E.A., Gendreau, M., Ghiani, G., Laporte, G.: Solving the hierarchical chinese postman problem as a rural postman problem. European J. Oper. Res.\u00a0155(1), 44\u201350 (2004)","journal-title":"European J. Oper. Res."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-16926-7_11","volume-title":"Graph Theoretic Concepts in Computer Science","author":"F. Dorn","year":"2010","unstructured":"Dorn, F., Moser, H., Niedermeier, R., Weller, M.: Efficient Algorithms for Eulerian Extension. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 100\u2013111. Springer, Heidelberg (2010)"},{"key":"25_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Dror, M.: Arc Routing: Theory, Solutions, and Applications. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4615-4495-1"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Oper. Res.\u00a043(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"key":"25_CR8","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"3","key":"25_CR9","first-page":"538","volume":"26","author":"G.N. Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. J.\u00a0ACM\u00a026(3), 538\u2013554 (1979)","journal-title":"J.\u00a0ACM"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"H\u00f6hn, W., Jacobs, T., Megow, N.: On Eulerian extensions and their application to no-wait flowshop scheduling. J. Sched (to appear, 2011)","DOI":"10.1007\/s10951-011-0241-1"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra, J.K., Kan, A.H.G.R.: On general routing problems. Networks\u00a06(3), 273\u2013280 (1976)","journal-title":"Networks"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C.S. Orloff","year":"1974","unstructured":"Orloff, C.S.: A fundamental problem in vehicle routing. Networks\u00a04(1), 35\u201364 (1974)","journal-title":"Networks"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1002\/net.3230060306","volume":"6","author":"C.S. Orloff","year":"1976","unstructured":"Orloff, C.S.: On general routing problems: Comments. Networks\u00a06(3), 281\u2013284 (1976)","journal-title":"Networks"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.cor.2005.05.008","volume":"34","author":"N. Perrier","year":"2007","unstructured":"Perrier, N., Langevin, A., Campbell, J.F.: A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal. Comput. Oper. Res.\u00a034(1), 258\u2013294 (2007)","journal-title":"Comput. Oper. Res."},{"key":"25_CR16","unstructured":"Sorge, M.: On making directed graphs Eulerian. Diplomarbeit, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena (2011), Available electronically. arXiv:1101.4283 [cs.DM]"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T04:00:20Z","timestamp":1560916820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}