{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:42:27Z","timestamp":1757313747041,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319065687"},{"type":"electronic","value":"9783319065694"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06569-4_7","type":"book-chapter","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T20:16:15Z","timestamp":1397247375000},"page":"99-104","source":"Crossref","is-referenced-by-count":2,"title":["Approximating the Minimum Tour Cover with a Compact Linear Program"],"prefix":"10.1007","author":[{"given":"Viet Hung","family":"Nguyen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(93)90072-H","volume":"47","author":"E.M. Arkin","year":"1993","unstructured":"Arkin, E.M., Halld\u00f3rsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Information Processing Letters\u00a047, 275\u2013282 (1993)","journal-title":"Information Processing Letters"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1023\/A:1011445210568","volume":"5","author":"R. Carr","year":"2001","unstructured":"Carr, R., Fujito, T., Konjevod, G., Parekh, O.: A 2 1\/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. Journal of Combinatorial Optimization\u00a05(3), 317\u2013326 (2001)","journal-title":"Journal of Combinatorial Optimization"},{"key":"7_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University (1976)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-36478-1_3","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J., Johnson, E.L.: Matching: A Well-solved Class of Integer Linear Programs. In: Combinatorial Optimization - Eureka, You Shrink!, pp. 27\u201330. Springer-Verlag New York, Inc., New York (2003)"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2151171.2151179","volume":"8","author":"T. Fujito","year":"2012","unstructured":"Fujito, T.: How to trim a mst: A 2-approximation algorithm for minimum cost-tree cover. ACM Trans. Algorithms\u00a08(2), 16:1\u201316:11 (2012)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00383-8","volume":"118","author":"T. Fujito","year":"2002","unstructured":"Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics\u00a0118(3), 199\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00453-003-1071-0","volume":"38","author":"J. Konemann","year":"2003","unstructured":"Konemann, J., Konjevod, G., Parekh, O., Sinha, A.: Improved approximations for tour and tree covers. Algorithmica\u00a038(3), 441\u2013449 (2003)","journal-title":"Algorithmica"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06569-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T01:48:03Z","timestamp":1676857683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06569-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319065687","9783319065694"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06569-4_7","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}