{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:41Z","timestamp":1759638281094},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T00:00:00Z","timestamp":1304035200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00453-011-9516-3","type":"journal-article","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T17:16:15Z","timestamp":1304010975000},"page":"602-615","source":"Crossref","is-referenced-by-count":10,"title":["Minimum-Perimeter Intersecting Polygons"],"prefix":"10.1007","volume":"63","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Minghui","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,29]]},"reference":[{"key":"9516_CR1","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1090\/S0002-9947-1961-0120222-7","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. Trans. Am. Math. Soc. 99, 272\u2013277 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"9516_CR2","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1090\/S0002-9947-1963-0143105-7","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. Trans. Am. Math. Soc. 106, 270\u2013279 (1963)","journal-title":"Trans. Am. Math. Soc."},{"key":"9516_CR3","doi-asserted-by":"crossref","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 Appl. Math. 55, 197\u2013218 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9516_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. Comb. Probab. Comput. 1, 295\u2013302 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"9516_CR5","doi-asserted-by":"crossref","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\u00a0der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57, 22\u201336 (2005)","journal-title":"J. Algorithms"},{"key":"9516_CR6","doi-asserted-by":"crossref","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. Algorithms 48, 135\u2013159 (2003)","journal-title":"J. Algorithms"},{"key":"9516_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. Freeman, New York (1979)"},{"key":"9516_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-642-03367-4_32","volume-title":"Proceedings of the 23rd International Workshop on Algorithms and Data Structures","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: Proceedings of the 23rd International Workshop on Algorithms and Data Structures. LNCS, vol. 5664, pp. 363\u2013374 (2009)"},{"key":"9516_CR9","doi-asserted-by":"crossref","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. J. Discrete Algorithms 6, 583\u2013594 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"9516_CR10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00453-008-9174-2","volume":"56","author":"M. L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and smallest convex hulls for imprecise points. Algorithmica 56, 235\u2013269 (2010)","journal-title":"Algorithmica"},{"key":"9516_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley, New York (1995)"},{"key":"9516_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1142\/S0218195995000143","volume":"5","author":"D. Rappaport","year":"1995","unstructured":"Rappaport, D.: Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 5, 243\u2013265 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9516_CR13","unstructured":"Welzl, E.: The smallest rectangle enclosing a closed curve of length \u03c0, manuscript (1993). Available at http:\/\/www.inf.ethz.ch\/personal\/emo\/SmallPieces.html"},{"key":"9516_CR14","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: Goodman, J., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 73\u201396. Chapman & Hall, London (2004)","edition":"2"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9516-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9516-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9516-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:07Z","timestamp":1559137507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9516-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,29]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9516"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9516-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,29]]}}}