{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:45:39Z","timestamp":1751877939001},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_26","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:09:56Z","timestamp":1330189796000},"page":"354-366","source":"Crossref","is-referenced-by-count":11,"title":["The chinese postman problem for mixed graphs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"issue":"Supplement1","key":"26_CR1","first-page":"B73","volume":"13","author":"J. Edmonds","year":"1965","unstructured":"EDMONDS, J., The Chinese Postman Problem. Operations Research 13, Supplement 1 (1965), B73\u2013B77.","journal-title":"Operations Research"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"EDMONDS, J. and JOHNSON, E.L., Matching, Euler Tours and the Chinese Postman. Mathematical Programming 5 (1973), 88\u2013124.","journal-title":"Mathematical Programming"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G. N. Frederickson","year":"1979","unstructured":"FREDERICKSON, G.N., Approximation Algorithms for Some Postman Problems. JACM 26 (1979), 538\u2013554.","journal-title":"JACM"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G. N. Frederickson","year":"1978","unstructured":"FREDERICKSON, G.N., HECHT, M.S., and KIM, C.E., Approximation Algorithms for Some Routing Problems. Siam Journal of Computing 7 (1978), 178\u2013193.","journal-title":"Siam Journal of Computing"},{"key":"26_CR5","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"LAWLER, E.L., Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York (1976)."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J. K. Lenstra","year":"1976","unstructured":"LENSTRA, J.K., and RINNOOY KAN, A.H.G., On General Routing Problems. Networks 6 (1976), 273\u2013280.","journal-title":"Networks"},{"key":"26_CR7","first-page":"237","volume":"1","author":"K. Mei \u2014 Ko","year":"1962","unstructured":"MEI \u2014 KO K., Graphic Programming Using Odd or Even Points. Chinese Mathematics 1 (1962), 237\u2013277.","journal-title":"Chinese Mathematics"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.25.7.643","volume":"25","author":"E. Minieka","year":"1979","unstructured":"MINIEKA, E., The Chinese Postman Problem for Mixed Networks. Management Science 25 (1979), 643\u2013648.","journal-title":"Management Science"},{"key":"26_CR9","doi-asserted-by":"crossref","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 4 (1974), 35\u201364.","journal-title":"Networks"},{"key":"26_CR10","doi-asserted-by":"crossref","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 6 (1976), 281\u2013284.","journal-title":"Networks"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/321958.321974","volume":"23","author":"C. H. Papadimitriou","year":"1976","unstructured":"PAPADIMITRIOU, C.H., On the Complexity of Edge Traversing. JACM 23 (1976), 544\u2013554.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:36:55Z","timestamp":1619555815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}