{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:23:56Z","timestamp":1777559036666,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407706","type":"print"},{"value":"9783540451983","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_3","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:32:30Z","timestamp":1294439550000},"page":"24-35","source":"Crossref","is-referenced-by-count":15,"title":["Covering Graphs Using Trees and Stars"],"prefix":"10.1007","author":[{"given":"G.","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"K\u00f6nemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Arkin, E., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems (2003) (manuscript)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Charikar, M., Raz, D.: Approximating min-sum k-clustering in metric spaces. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 11\u201320 (2001)","DOI":"10.1145\/380752.380754"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (2001)","DOI":"10.1145\/380752.380753"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Chudak, F., Shmoys, D.: Improved approximation algorithms for a capacitated facility location problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 875\u2013876 (1999)","DOI":"10.1007\/3-540-48777-8_8"},{"key":"3_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2000)"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M. Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.: A simple heuristic for the p-center problem. Operations Research Letters\u00a03(6), 285\u2013288 (1985)","journal-title":"Operations Research Letters"},{"key":"3_CR7","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655\u2013664 (2003)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Computing\u00a07, 178\u2013193 (1978)","journal-title":"SIAM J. Computing"},{"key":"3_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0166-218X(98)00100-0","volume":"89","author":"N. Guttman-Beck","year":"1998","unstructured":"Guttman-Beck, N., Hassin, R.: Approximation algorithms for min-sum p-clustering. Discrete Applied Mathematics\u00a089, 125\u2013142 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR11","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Haimovich","year":"1988","unstructured":"Haimovich, M., Rinnooy Kan, A., Stougie, L.: Vehicle Routing: Methods and Studies. Elsevier, Amsterdam (1988)"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Shmoys, D.: A best possible approximation algorithm for the k-center problem. Mathematics of Operations Research\u00a010(2), 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"3_CR13","unstructured":"Levin, A.: Private communication (May 2003)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D. Shmoys","year":"1993","unstructured":"Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming A\u00a062, 461\u2013474 (1993)","journal-title":"Mathematical Programming A"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM monographs on discrete mathematics and applications (2002)","DOI":"10.1137\/1.9780898718515"}],"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\/978-3-540-45198-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:05:09Z","timestamp":1559916309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}