{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:56Z","timestamp":1725552476313},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_38","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"433-445","source":"Crossref","is-referenced-by-count":1,"title":["Minimum-Perimeter Intersecting Polygons"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Minghui","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.2307\/1993396","volume":"99","author":"G.E. Andrews","year":"1961","unstructured":"Andrews, G.E.: An asymptotic expression for the number of solutions of a general class of Diophantine equations. Transactions of the American Mathematical Society\u00a099, 272\u2013277 (1961)","journal-title":"Transactions of the American Mathematical Society"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"270","DOI":"10.2307\/1993769","volume":"106","author":"G.E. Andrews","year":"1963","unstructured":"Andrews, G.E.: A lower bound for the volume of strictly convex bodies with many boundary lattice points. Transactions of the American Mathematical Society\u00a0106, 270\u2013279 (1963)","journal-title":"Transactions of the American Mathematical Society"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"E.M. Arkin","year":"1994","unstructured":"Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics\u00a055, 197\u2013218 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"38_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1017\/S0963548300000341","volume":"1","author":"I. B\u00e1r\u00e1ny","year":"1992","unstructured":"B\u00e1r\u00e1ny, I., Pach, J.: On the number of convex lattice polygons. Combinatorics, Probability & Computing\u00a01, 295\u2013302 (1992)","journal-title":"Combinatorics, Probability & Computing"},{"key":"38_CR5","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. Journal of Algorithms\u00a057, 22\u201336 (2005)","journal-title":"Journal of Algorithms"},{"key":"38_CR6","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. Journal of Algorithms\u00a048, 135\u2013159 (2003)","journal-title":"Journal of Algorithms"},{"key":"38_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-642-03367-4_32","volume-title":"WADS 2009","author":"F. Hassanzadeh","year":"2009","unstructured":"Hassanzadeh, F., Rappaport, D.: Approximation algorithms for finding a minimum perimeter polygon intersecting a set of line segments. In: Dehne, F., Gavrilova, M.L., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 363\u2013374. Springer, Heidelberg (2009)"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.jda.2008.04.002","volume":"6","author":"M. Kreveld van","year":"2008","unstructured":"van Kreveld, M., L\u00f6ffler, M.: Approximating largest convex hulls for imprecise points. Journal of Discrete Algorithms\u00a06, 583\u2013594 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and smallest convex hulls for imprecise points. Algorithmica (2008), doi:10.1007\/s00453-008-9174-2","DOI":"10.1007\/s00453-008-9174-2"},{"issue":"3","key":"38_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1142\/S0218195995000143","volume":"5","author":"D. Rappaport","year":"1995","unstructured":"Rappaport, D.: Minimum polygon transversals of line segments. International Journal of Computational Geometry and Applications\u00a05(3), 243\u2013265 (1995)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"38_CR12","unstructured":"Welzl, E.: The smallest rectangle enclosing a closed curve of length \u03c0 (1993) (manuscript), \n                  \n                    http:\/\/www.inf.ethz.ch\/personal\/emo\/SmallPieces.html"},{"key":"38_CR13","first-page":"73","volume-title":"Handbook of Discrete and Computational Geometry","author":"R. Wenger","year":"2004","unstructured":"Wenger, R.: Helly-type theorems and geometric transversals. In: Handbook of Discrete and Computational Geometry, 2nd edn., pp. 73\u201396. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"38_CR14","volume-title":"Convex Figures","author":"I.M. Yaglom","year":"1961","unstructured":"Yaglom, I.M., Boltyanski, V.G.: Convex Figures. Holt, Rinehart and Winston, New York (1961)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:36Z","timestamp":1619784336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}