{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:17:33Z","timestamp":1742912253755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"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-89543-3_22","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"257-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Color Spanning Circle in\u00a0Imprecise Setup"],"prefix":"10.1007","author":[{"given":"Ankush","family":"Acharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh K.","family":"Jallu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahideh","family":"Keikha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Saumell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abellanas, M., et al.: Smallest color-spanning objects. In: ESA, pp. 278\u2013289 (2001)","DOI":"10.1007\/3-540-44676-1_23"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2017.11.031","volume":"725","author":"A Acharyya","year":"2018","unstructured":"Acharyya, A., Nandy, S.C., Roy, S.: Minimum width color spanning annulus. Theoret. Comput. Sci. 725, 16\u201330 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jalgor.2005.01.010","volume":"57","author":"M de Berg","year":"2005","unstructured":"de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57(1), 22\u201336 (2005)","journal-title":"J. Algorithms"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jalgor.2004.06.009","volume":"62","author":"S Cabello","year":"2007","unstructured":"Cabello, S.: Approximation algorithms for spreading points. J. Algorithms 62(2), 49\u201373 (2007)","journal-title":"J. Algorithms"},{"key":"22_CR5","unstructured":"Consuegra, M.E., Narasimhan, G.: Geometric avatar problems. In: FSTTCS, pp. 389\u2013400 (2013)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Daescu, O., Ju, W., Luo, J.: NP-completeness of spreading colored points. In: COCOA, pp. 41\u201350 (2010)","DOI":"10.1007\/978-3-642-17458-2_5"},{"issue":"05","key":"22_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0218195909003076","volume":"19","author":"S Das","year":"2009","unstructured":"Das, S., Goswami, P.P., Nandy, S.C.: Smallest color-spanning object revisited. Internat. J. Comput. Geom. Appl. 19(05), 457\u2013478 (2009)","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1137\/050636589","volume":"21","author":"M Dror","year":"2008","unstructured":"Dror, M., Orlin, J.B.: Combinatorial optimization with explicit delineation of the ground set by a collection of subsets. SIAM J. Discrete Math. 21(4), 1019\u20131034 (2008)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00224-011-9331-x","volume":"51","author":"A Dumitrescu","year":"2012","unstructured":"Dumitrescu, A., Jiang, M.: Dispersion in disks. Theory Comput. Syst. 51(2), 125\u2013142 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2004.02.018","volume":"145","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Systems of distant representatives. Discrete Appl. Math. 145(2), 306\u2013316 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"21\u201322","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.ipl.2011.07.015","volume":"111","author":"R Fleischer","year":"2011","unstructured":"Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets is hard. Inform. Process. Lett. 111(21\u201322), 1054\u20131056 (2011)","journal-title":"Inform. Process. Lett."},{"key":"22_CR12","unstructured":"Fraser, R.: Algorithms for geometric covering and piercing problems. Ph.D. thesis, University of Waterloo (2013)"},{"key":"22_CR13","unstructured":"Hasheminejad, J., Khanteimouri, P., Mohades, A.: Computing the smallest color spanning equilateral triangle. In: EuroCG, pp. 32\u201335 (2015)"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"DP Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9(3), 267\u2013291 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jagm.1996.0013","volume":"20","author":"S Jadhav","year":"1996","unstructured":"Jadhav, S., Mukhopadhyay, A., Bhattacharya, B.: An optimal algorithm for the intersection radius of a set of convex polygons. J. Algorithms 20(2), 244\u2013267 (1996)","journal-title":"J. Algorithms"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Jiang, M., Wang, H.: Shortest color-spanning intervals. In: COCOON, pp. 288\u2013299 (2014)","DOI":"10.1007\/978-3-319-08783-2_25"},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s10878-012-9458-y","volume":"26","author":"W Ju","year":"2013","unstructured":"Ju, W., Fan, C., Luo, J., Zhu, B., Daescu, O.: On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2), 266\u2013283 (2013)","journal-title":"J. Comb. Optim."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Computing the smallest color-spanning axis-parallel square. In: ISAAC, pp. 634\u2013643 (2013)","DOI":"10.1007\/978-3-642-45030-3_59"},{"issue":"32","key":"22_CR19","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1016\/j.tcs.2011.01.039","volume":"412","author":"C Knauer","year":"2011","unstructured":"Knauer, C., L\u00f6ffler, M., Scherfenberg, M., Wolle, T.: The directed Hausdorff distance between imprecise point sets. Theoret. Comput. Sci. 412(32), 4173\u20134186 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discrete Math. 5(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"22_CR21","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. 43(4), 419\u2013433 (2010)","journal-title":"Comput. Geom."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Manzini, R., Gamberini, R.: Design, management and control of logistic distribution systems. Int. J. Adv. Robot. Syst. 263\u2013290 (2008)","DOI":"10.5772\/5347"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Pop, P.C.: The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances. Eur. J. Oper. Res. (2019)","DOI":"10.1016\/j.ejor.2019.05.017"},{"key":"22_CR25","unstructured":"Robert, J.M., Toussaint, G.: Computational geometry and facility location. In: Operations Research and Management Science, pp. 11\u201315 (1990)"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Salesin, D., Stolfi, J., Guibas, L.: Epsilon geometry: building robust algorithms from imprecise computations. In: SoCG, pp. 208\u2013217 (1989)","DOI":"10.1145\/73833.73857"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K.H., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: ICDE, pp. 688\u2013699 (2009)","DOI":"10.1109\/ICDE.2009.77"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:09:47Z","timestamp":1634782187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_22","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":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"131","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":"56","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":"43% - 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":"2.2","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)"}}]}}