{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:18Z","timestamp":1725745278851},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_8","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"96-109","source":"Crossref","is-referenced-by-count":0,"title":["On the Total Perimeter of Homothetic Convex Bodies in a Convex Container"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"8_CR2","unstructured":"Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer (2005)"},{"key":"8_CR3","unstructured":"Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximation Algorithms for NP-hard Problems, pp. 296\u2013345. PWS (1997)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jalgor.2005.01.010","volume":"57","author":"M. Berg de","year":"2005","unstructured":"de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J.\u00a0Algorithms\u00a057(1), 22\u201336 (2005)","journal-title":"J.\u00a0Algorithms"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0196-6774(03)00047-6","volume":"48","author":"A. Dumitrescu","year":"2003","unstructured":"Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J.\u00a0Algorithms\u00a048(1), 135\u2013159 (2003)","journal-title":"J.\u00a0Algorithms"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s00453-009-9329-9","volume":"60","author":"A. Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Minimum weight convex Steiner partitions. Algorithmica\u00a060(3), 627\u2013652 (2011)","journal-title":"Algorithmica"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: The traveling salesman problem for lines, balls and planes, in. In: Proc. 24th SODA, pp. 828\u2013843. SIAM (2013)","DOI":"10.1137\/1.9781611973105.59"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-13883-8_78","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C. Levcopoulos","year":"1984","unstructured":"Levcopoulos, C., Lingas, A.: Bounds on the length of convex partitions of polygons. In: Joseph, M., Shyamasundar, R.K. (eds.) FSTTCS 1984. LNCS, vol.\u00a0181, pp. 279\u2013295. Springer, Heidelberg (1984)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Mata, C., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems. In: Proc. 11th SOCG, pp. 360\u2013369. ACM (1995)","DOI":"10.1145\/220279.220318"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. In: Proc. 26th SOCG, pp. 183\u2013191. ACM (2010)","DOI":"10.1145\/1810959.1810992"}],"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-642-40328-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T02:17:17Z","timestamp":1563675437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}