{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:37:08Z","timestamp":1743057428980,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_16","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"226-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Approximation Algorithm for\u00a0Max-Covering Circle Problem"],"prefix":"10.1007","author":[{"given":"Kaiqi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Siyuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jirun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B Aronov","year":"2008","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput. 38(3), 899\u2013921 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00454-020-00239-3","volume":"66","author":"TM Chan","year":"2021","unstructured":"Chan, T.M., Har-Peled, S.: Smallest k-enclosing rectangle revisited. Discrete Comput. Geomet. 66(2), 769\u2013791 (2021)","journal-title":"Discrete Comput. Geomet."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"BM Chazelle","year":"1986","unstructured":"Chazelle, B.M., Lee, D.T.: On a circle placement problem. Computing 36(1), 1\u201316 (1986)","journal-title":"Computing"},{"issue":"11","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.14778\/2350229.2350230","volume":"5","author":"D Choi","year":"2012","unstructured":"Choi, D., Chung, C., Tao, Y.: A scalable algorithm for maximizing range sum in spatial databases. Proc. VLDB Endow 5(11), 1088\u20131099 (2012)","journal-title":"Proc. VLDB Endow"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1006\/jagm.1995.1048","volume":"19","author":"A Datta","year":"1995","unstructured":"Datta, A., Lenhof, H.P., Schwarz, C., Smid, M.: Static and dynamic algorithms for k-point clustering problems. J. Algorithms 19(3), 474\u2013503 (1995)","journal-title":"J. Algorithms"},{"key":"16_CR7","unstructured":"De Berg, M., Cabello, S., Cheong, O., Eppstein, D., Knauer, C.: Covering many points with a small-area box. arXiv preprint arXiv:1612.02149 (2016)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"De Berg, M., Cabello, S., Har-Peled, S.: Covering many or few points with unit disks. Theory Comput. Syst. 45(3) (2009)","DOI":"10.1007\/s00224-008-9135-9"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0925-7721(94)90003-5","volume":"4","author":"A Efrat","year":"1994","unstructured":"Efrat, A., Sharir, M., Ziv, A.: Computing the smallest k-enclosing circle and related problems. Comput. Geom. 4(3), 119\u2013136 (1994)","journal-title":"Comput. Geom."},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geomet. 11(3), 321\u2013350 (1994)","journal-title":"Discrete Comput. Geomet."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1123-0","volume":"41","author":"S Har-Peled","year":"2005","unstructured":"Har-Peled, S., Mazumdar, S.: Fast algorithms for computing the smallest k-enclosing circle. Algorithmica 41(3), 147\u2013157 (2005)","journal-title":"Algorithmica"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Hemmer, M., Kleinbort, M., Halperin, D.: Improved implementation of point location in general two-dimensional subdivisions. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 611\u2013623. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_53","DOI":"10.1007\/978-3-642-33090-2_53"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4), 310\u2013323 (1983)","journal-title":"J. Algorithms"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2019.01.007","volume":"81","author":"H Kaplan","year":"2019","unstructured":"Kaplan, H., Roy, S., Sharir, M.: Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81, 1\u201311 (2019)","journal-title":"Comput. Geom."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Mahapatra, P.R.S., Karmakar, A., Das, S., Goswami, P.P.: k-enclosing axis-parallel square. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011. LNCS, vol. 6784, pp. 84\u201393. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21931-3_7","DOI":"10.1007\/978-3-642-21931-3_7"},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(94)00190-A","volume":"53","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On enclosing k points by a circle. Inf. Process. Lett. 53(4), 217\u2013221 (1995)","journal-title":"Inf. Process. Lett."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"issue":"8","key":"16_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(95)00029-X","volume":"29","author":"SC Nandy","year":"1995","unstructured":"Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Comput. Math. Appl. 29(8), 45\u201361 (1995)","journal-title":"Comput. Math. Appl."},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, New York (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6","DOI":"10.1007\/978-1-4612-1098-6"},{"issue":"13","key":"16_CR21","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.14778\/2536258.2536266","volume":"6","author":"Y Tao","year":"2013","unstructured":"Tao, Y., Hu, X., Choi, D., Chung, C.: Approximate Maxrs in spatial databases. Proc. VLDB Endow 6(13), 1546\u20131557 (2013)","journal-title":"Proc. VLDB Endow"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, K., Gao, H., Han, X., Chen, J., Li, J.: Maximizing range sum in trajectory data. In: IEEE International Conference on Data Engineering, pp. 755\u2013766 (2022)","DOI":"10.1109\/ICDE53745.2022.00061"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:08:10Z","timestamp":1707556090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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":"6","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)"}}]}}