{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:45:17Z","timestamp":1751877917624},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645900"},{"type":"electronic","value":"9783540693468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_13","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T15:51:29Z","timestamp":1186069889000},"page":"169-179","source":"Crossref","is-referenced-by-count":4,"title":["Approximation Algorithms for the Mixed Postman Problem"],"prefix":"10.1007","author":[{"given":"Balaji","family":"Raghavachari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeyakesavan","family":"Veerasamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","first-page":"354","volume-title":"Proceedings of the International Workshop on Graph Theoretic Concepts in Computer Science","author":"P. Brucker","year":"1980","unstructured":"P. Brucker. The Chinese postman problem for mixed networks. In Proceedings of the International Workshop on Graph Theoretic Concepts in Computer Science, LNCS, Vol. 100, pages 354\u2013366. Springer, 1980."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"N. Christofides, E. Benavent, V. Campos, A. Corberan, and E. Mota. An optimal method for the mixed postman problem. In System Modelling and Optimization, Notes in Control and Information Sciences, Vol. 59. Springer, 1984.","DOI":"10.1007\/BFb0008937"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds and E. L. Johnson. Matching, Euler tours and the Chinese postman. Math. Programming, 5:88\u2013124, 1973.","journal-title":"Math. Programming"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"H. A. Eiselt","year":"1995","unstructured":"H. A. Eiselt. Arc routing problems, Part I: The Chinese postman problem. Operations Research, 43:231\u2013242, 1995.","journal-title":"Operations Research"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H. A. Eiselt","year":"1995","unstructured":"H. A. Eiselt. Arc routing problems, Part II: The rural postman problem. Operations Research, 43:399\u2013414, 1995.","journal-title":"Operations Research"},{"key":"13_CR6","volume-title":"Flows in Networks","author":"L. R. Ford","year":"1962","unstructured":"L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton U. Press, Princeton, NJ, 1962."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G. N. Frederickson","year":"1979","unstructured":"G. N. Frederickson. Approximation algorithms for some postman problems. J. Assoc. Comput. Mach., 26:538\u2013554, 1979.","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"13_CR9","first-page":"273","volume":"1","author":"M. Guan","year":"1962","unstructured":"M. Guan. Graphic programming using odd and even points. Chinese Math., 1:273\u2013277, 1962.","journal-title":"Chinese Math."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0166-218X(79)90016-7","volume":"1","author":"C. H. Kappauf","year":"1979","unstructured":"C. H. Kappauf and G. J. Koehler. The mixed postman problem. Discret. Appl. Math., 1:89\u2013103, 1979.","journal-title":"Discret. Appl. Math."},{"key":"13_CR11","volume-title":"An optimal algorithm for the mixed Chinese postman problem","author":"Y. Nobert","year":"1991","unstructured":"Y. Nobert and J. C. Picard. An optimal algorithm for the mixed Chinese postman problem. Publication # 799. Centre de recherche sur les transports, Montreal, Canada, 1991."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/(SICI)1097-0037(199603)27:2<97::AID-NET1>3.0.CO;2-8","volume":"27","author":"Y. Nobert","year":"1996","unstructured":"Y. Nobert and J. C. Picard. An optimal algorithm for the mixed Chinese postman problem. Networks, 27:95\u2013108, 1996.","journal-title":"Networks"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/321958.321974","volume":"23","author":"C. H. Papadimitriou","year":"1976","unstructured":"C. H. Papadimitriou. On the complexity of edge traversing. J. Assoc. Comput. Mach., 23:544\u2013554, 1976.","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6377(94)90073-6","volume":"16","author":"W. L. Pearn","year":"1994","unstructured":"W. L. Pearn. Solvable cases of the k-person Chinese postman problem. Operations Research Letters, 16:241\u2013244, 1994.","journal-title":"Operations Research Letters"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/0305-0548(94)00036-8","volume":"22","author":"W. L. Pearn","year":"1995","unstructured":"W. L. Pearn and C. M. Liu. Algorithms for the Chinese postman problem on mixed networks. Computers & Operations Research, 22:479\u2013489, 1995.","journal-title":"Computers & Operations Research"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0167-6377(93)90021-8","volume":"14","author":"T. K. Ralphs","year":"1993","unstructured":"T. K. Ralphs. On the mixed Chinese postman problem. Operations Research Letters, 14:123\u2013127, 1993.","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T21:36:40Z","timestamp":1550439400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}