{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:27:33Z","timestamp":1743060453395,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_42","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"585-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for the Line-Constrained Disk Coverage and Related Problems"],"prefix":"10.1007","author":[{"given":"Logan","family":"Pedersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., et al.: Minimum-cost coverage of point sets by disks. In: Proceedings of the 22nd Annual Symposium on Computational Geometry (SoCG), pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), and the 10th International Conference on Randomization and Computation (RANDOM), pp. 3\u201314 (2006)","DOI":"10.1007\/11830924_3"},{"issue":"9","key":"42_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J Bentley","year":"1979","unstructured":"Bentley, J., Ottmann, T.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. 28(9), 643\u2013647 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"42_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry \u2013 Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry \u2013 Algorithms and Applications, 3rd edn. Springer-Verlag, Berlin (2008)","edition":"3"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Proceedings of the 13th European Symposium on Algorithms, pp. 460\u2013471 (2005)","DOI":"10.1007\/11561071_42"},{"key":"42_CR6","unstructured":"Biniaz, A., Bose, P., Carmi, P., Maheshwari, A., Munro, I., Smid, M.: Faster algorithms for some optimization problems on collinear points. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG), pp. 1\u201314 (2018)"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Brown, K.: Comments on Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. 30, 147\u2013148 (1981)","DOI":"10.1109\/TC.1981.6312179"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.comgeo.2012.04.001","volume":"47","author":"T Chan","year":"2014","unstructured":"Chan, T., Grant, E.: Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. Theory Appl. 47, 112\u2013124 (2014)","journal-title":"Comput. Geom. Theory Appl."},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1142\/S1793830910000486","volume":"2","author":"F Claude","year":"2010","unstructured":"Claude, F., et al.: An improved line-separable algorithm for discrete unit disk cover. Discrete Math. Algorithms Appl. 2, 77\u201388 (2010)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Claude, F., Dorrigiv, R., Durocher, S., Fraser, R., L\u00f3pez-Ortiz, A., Salinger, A.: Practical discrete unit disk cover using an exact line-separable algorithm. In: Proceedings of the 20th International Symposium on Algorithm and Computation (ISAAC), pp. 45\u201354 (2009)","DOI":"10.1007\/978-3-642-10631-6_7"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"42_CR13","first-page":"65","volume":"3","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Lee, M.: Weighted geometric set cover problems revisited. J. Comput. Geom. 3, 65\u201385 (2012)","journal-title":"J. Comput. Geom."},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0196-6774(87)90012-5","volume":"3","author":"D Hochbaum","year":"1987","unstructured":"Hochbaum, D., Maass, W.: Fast approximation algorithms for a nonconvex covering problem. J. Algorithms 3, 305\u2013323 (1987)","journal-title":"J. Algorithms"},{"issue":"2","key":"42_CR15","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/s10878-012-9452-4","volume":"25","author":"A Karmakar","year":"2013","unstructured":"Karmakar, A., Das, S., Nandy, S., Bhattacharya, B.: Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2), 176\u2013190 (2013)","journal-title":"J. Comb. Optim."},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47, 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Li, J., Jin, Y.: A PTAS for the weighted unit disk cover problem. In: Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP), pp. 898\u2013909 (2015)","DOI":"10.1007\/978-3-662-47672-7_73"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960\u2013981 (1994)","journal-title":"J. ACM"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Mustafa, N., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proceedings of the 25th Annual Symposium on Computational Geometry (SoCG), pp. 17\u201322 (2009)","DOI":"10.1145\/1542362.1542367"},{"key":"42_CR20","unstructured":"Pedersen, L., Wang, H.: On the coverage of points in the plane by disks centered at a line. In: Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG), pp. 158\u2013164 (2018)"},{"key":"42_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1142\/S0218195916600049","volume":"26","author":"H Wang","year":"2016","unstructured":"Wang, H., Zhang, J.: Line-constrained $$k$$-median, $$k$$-means, and $$k$$-center problems in the plane. Int. J. Comput. Geom. Appl. 26, 185\u2013210 (2016)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:29:15Z","timestamp":1645183755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}