{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:35:21Z","timestamp":1787502921877,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030174019","type":"print"},{"value":"9783030174026","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_19","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:37:00Z","timestamp":1558345020000},"page":"224-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9062-4241","authenticated-orcid":false,"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1573-3496","authenticated-orcid":false,"given":"Dominik","family":"Krupke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"6","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1137\/S0097539700374550","volume":"31","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Biedl, T.C., Lazard, S., Robbins, S., Suri, S., Whitesides, S.: Curvature-constrained shortest paths in a convex polygon. SIAM J. Comp. 31(6), 1814\u20131851 (2002)","journal-title":"SIAM J. Comp."},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1137\/S0097539796307790","volume":"30","author":"PK Agarwal","year":"2000","unstructured":"Agarwal, P.K., Wang, H.: Approximation algorithms for curvature-constrained shortest paths. SIAM J. Comp. 30(6), 1739\u20131772 (2000)","journal-title":"SIAM J. Comp."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S0097539796312721","volume":"29","author":"A Aggarwal","year":"1999","unstructured":"Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., Schieber, B.: The angular-metric traveling salesman problem. SIAM J. Comp. 29(3), 697\u2013711 (1999)","journal-title":"SIAM J. Comp."},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1080\/02331934.2016.1276905","volume":"66","author":"O Aichholzer","year":"2017","unstructured":"Aichholzer, O., Fischer, A., Fischer, F., Meier, J.F., Pferschy, U., Pilz, A., Stan\u011bk, R.: Minimization and maximization versions of the quadratic travelling salesman problem. Optimization 66(4), 521\u2013546 (2017)","journal-title":"Optimization"},{"key":"19_CR5","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. In: Proceedings of 12th ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 138\u2013147 (2001)"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"EM Arkin","year":"2005","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. SIAM J. Comp. 35(3), 531\u2013566 (2005)","journal-title":"SIAM J. Comp."},{"issue":"1\u20132","key":"19_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"EM Arkin","year":"2000","unstructured":"Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Comp. Geom. 17(1\u20132), 25\u201350 (2000)","journal-title":"Comp. Geom."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Astroza, S., Patil, P.N., Smith, K.I., Bhat, C.R.: Transportation planning to accommodate needs of wind energy projects. In: Transportation Research Board-Annual Meeting (2017). Article 17\u201305309","DOI":"10.3141\/2669-02"},{"key":"19_CR9","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"G Ausiello","year":"2007","unstructured":"Ausiello, G., Bonifaci, V., Leonardi, S., Marchetti-Spaccamela, A.: Prize-collecting traveling salesman and related problems. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall\/CRC, Boca Raton (2007)"},{"key":"19_CR10","unstructured":"Becker, A.T., Debboun, M., Fekete, S.P., Krupke, D., Nguyen, A.: Zapping Zika with a mosquito-managing drone: Computing optimal flight patterns with minimum turn cost. In: Proceedings of 33rd Symposium on Computational Geometry (SoCG), pp. 62:1\u201362:5 (2017). Video at https:\/\/www.youtube.com\/watch?v=SFyOMDgdNao"},{"key":"19_CR11","unstructured":"Benbernou, N.M.: Geometric algorithms for reconfigurable structures. Ph.D. thesis, Massachusetts Institute of Technology (2011)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Boissonnat, J., Lazard, S.: A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. In: Proceedings of 12th Symposium on Computational Geometry (SoCG), pp. 242\u2013251 (1996)","DOI":"10.1145\/237218.237393"},{"key":"19_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial Optimization","author":"W Cook","year":"1997","unstructured":"Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. Wiley-Interscience, Hoboken (1997)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-20662-7_26","volume-title":"Experimental Algorithms","author":"IR de Assis","year":"2011","unstructured":"de Assis, I.R., de Souza, C.C.: Experimental evaluation of algorithms for the orthogonal milling problem with turn costs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 304\u2013314. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_26"},{"key":"19_CR15","unstructured":"Demaine, E.D., Mitchell, J. S. B., O\u2019Rourke, J.: The Open Problems Project. http:\/\/cs.smith.edu\/~orourke\/TOPP\/"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"LE Dubins","year":"1957","unstructured":"Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am. J. Math. 79(3), 497\u2013516 (1957)","journal-title":"Am. J. Math."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Krupke, D.: Covering tours and cycle covers with turn costs: hardness and approximation. arXiv (2018). http:\/\/arxiv.org\/abs\/1808.04417","DOI":"10.1007\/978-3-030-17402-6_19"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Krupke, D.: Practical methods for computing large covering tours and cycle covers with turn cost. In: Proceedings of 21st SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) (2019)","DOI":"10.1137\/1.9781611975499.15"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"SP Fekete","year":"1997","unstructured":"Fekete, S.P., Woeginger, G.J.: Angle-restricted tours in the plane. Comp. Geom. 8, 195\u2013218 (1997)","journal-title":"Comp. Geom."},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-16926-7_13","volume-title":"Graph Theoretic Concepts in Computer Science","author":"M Fellows","year":"2010","unstructured":"Fellows, M., Giannopoulos, P., Knauer, C., Paul, C., Rosamond, F.A., Whitesides, S., Yu, N.: Milling a graph with turn costs: a parameterized complexity perspective. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 123\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_13"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comp. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comp."},{"key":"19_CR22","unstructured":"Lazard, S., Reif, J., Wang, H.: The complexity of the two dimensional curvature-constrained shortest-path problem. In: Proceedings of 3rd Workshop on the Algorithmic Foundations of Robotics (WAFR), pp. 49\u201357 (1998)"},{"key":"19_CR23","unstructured":"Maurer, O.: Winkelminimierung bei \u00dcberdeckungsproblemen in Graphen. Diplomarbeit, Technische Universit\u00e4t Berlin (2009)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of 10th ACM symposium on Theory of computing (STOC), pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/3-540-45535-3_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"C Stein","year":"2001","unstructured":"Stein, C., Wagner, D.P.: Approximation algorithms for the minimum bends traveling salesman problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 406\u2013421. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_32"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Takei, R., Tsai, R., Shen, H., Landa, Y.: A practical path-planning algorithm for a simple car: a Hamilton-Jacobi approach. In: Proceedings of 29th American Control Conference (ACC), pp. 6175\u20136180 (2010)","DOI":"10.1109\/ACC.2010.5531607"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T08:56:50Z","timestamp":1710320210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}