乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T22:41:13Z","timestamp":1726353673343},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1016\/j.jalgor.2005.01.010","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T12:14:54Z","timestamp":1112444094000},"page":"22-36","source":"Crossref","is-referenced-by-count":81,"title":["TSP with neighborhoods of varying size"],"prefix":"10.1016","volume":"57","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[]},{"given":"A. Frank","family":"van der Stappen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jalgor.2005.01.010_bib001","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(95)00005-8","article-title":"Computing depth orders for fat objects and related problems","volume":"5","author":"Agarwal","year":"1995","journal-title":"Comput. Geom."},{"issue":"5 & 6","key":"10.1016\/j.jalgor.2005.01.010_bib002","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF01758853","article-title":"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures","volume":"8","author":"Alt","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/j.jalgor.2005.01.010_bib003","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","article-title":"Approximation algorithms for the geometric covering salesman problem","volume":"55","author":"Arkin","year":"1994","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10.1016\/j.jalgor.2005.01.010_bib004","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","article-title":"Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.jalgor.2005.01.010_bib005","series-title":"Proc. 26th International Colloquium on Automata, Languages and Programming","first-page":"200","article-title":"On some tighter inapproximability results","volume":"vol. 1644","author":"Berman","year":"1999"},{"issue":"3","key":"10.1016\/j.jalgor.2005.01.010_bib006","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0020-0190(01)00321-0","article-title":"Walking around fat obstacles","volume":"83","author":"Chew","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.jalgor.2005.01.010_bib007","series-title":"Proc. 12th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"38","article-title":"Approximation algorithms for TSP with neighborhoods in the plane","author":"Dumitrescu","year":"2001"},{"key":"10.1016\/j.jalgor.2005.01.010_bib008","series-title":"Proc. 8th Annual ACM Symposium on Theory of Computing","first-page":"10","article-title":"Some NP-complete geometric problems","author":"Garey","year":"1976"},{"issue":"4","key":"10.1016\/j.jalgor.2005.01.010_bib009","first-page":"469","article-title":"A fast approximation algorithm for TSP with neighborhoods","volume":"6","author":"Gudmundsson","year":"1999","journal-title":"Nordic J. Comput."},{"issue":"3","key":"10.1016\/j.jalgor.2005.01.010_bib010","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","article-title":"A pedestrian approach to ray shooting: shoot a ray, take a walk","volume":"18","author":"Hershberger","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/j.jalgor.2005.01.010_bib011","series-title":"Proc. 3rd Workshop on Algorithms and Data Structures","first-page":"452","article-title":"On fat partitioning, fat covering, and the union size of polygons","volume":"vol. 709","author":"van Kreveld","year":"1993"},{"key":"10.1016\/j.jalgor.2005.01.010_bib012","series-title":"Proc. 11th Annual ACM Symposium on Computational Geometry","first-page":"360","article-title":"Approximation algorithms for geometric tour and network design problems","author":"Mata","year":"1995"},{"key":"10.1016\/j.jalgor.2005.01.010_bib013","series-title":"Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science","first-page":"49","article-title":"Fat triangles determine linearly many holes","author":"Matou\u0161ek","year":"1991"},{"key":"10.1016\/j.jalgor.2005.01.010_bib014","series-title":"Handbook of Computational Geometry","article-title":"Geometric shortest paths and network optimization","author":"Mitchell","year":"2000"},{"issue":"4","key":"10.1016\/j.jalgor.2005.01.010_bib015","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0097539796309764","article-title":"Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems","volume":"28","author":"Mitchell","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.jalgor.2005.01.010_bib016","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The Euclidean traveling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jalgor.2005.01.010_bib017","series-title":"Proc. 15th International Workshop Graph-Theoretic Concepts in Computer Science","first-page":"196","article-title":"Beyond Steiner's problem: a VLSI oriented generalization","volume":"vol. 411","author":"Reich","year":"1989"},{"key":"10.1016\/j.jalgor.2005.01.010_bib018","unstructured":"B. Shaleooi, Algoritmer f\u00f6r pl\u00e5tsk\u00e4rning (English translation: Algorithms for cutting sheets of metal), LUNDFD6\/NFCS-5189\/1\u201344\/2001, Master thesis, Department of Computer Science, Lund University, 2001"},{"key":"10.1016\/j.jalgor.2005.01.010_bib019","unstructured":"P. Slav\u00edk, The Errand Scheduling Problem, Technical report 97-02, Department of Computer Science and Engineering, SUNY Buffalo, 1997"},{"key":"10.1016\/j.jalgor.2005.01.010_bib020","doi-asserted-by":"crossref","unstructured":"A.F. van der Stappen, Motion planning amidst fat obstacles, PhD Dissertation, Department of Computer Science, Utrecht University, Utrecht, Netherlands, 1994","DOI":"10.1145\/177424.177453"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677405000246?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677405000246?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:19:59Z","timestamp":1683058799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677405000246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["S0196677405000246"],"URL":"https:\/\/doi.org\/10.1016\/j.jalgor.2005.01.010","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}