{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:31:18Z","timestamp":1743017478147,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"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-92681-6_46","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"587-601","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0k-colored Rainbow Sets in\u00a0Fixed Dimensions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2821-5903","authenticated-orcid":false,"given":"Vahideh","family":"Keikha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamidreza","family":"Keikha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Mohades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"46_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-44676-1_23","volume-title":"Algorithms \u2014 ESA 2001","author":"M Abellanas","year":"2001","unstructured":"Abellanas, M., et al.: Smallest color-spanning objects. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278\u2013289. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_23"},{"issue":"4","key":"46_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"PK Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606\u2013635 (2004)","journal-title":"J. ACM"},{"issue":"2","key":"46_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.jda.2008.12.002","volume":"7","author":"R Atanassov","year":"2009","unstructured":"Atanassov, R., et al.: Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2), 239\u2013248 (2009)","journal-title":"J. Discrete Algorithms"},{"issue":"01","key":"46_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1142\/S0218195910003189","volume":"20","author":"M Benkert","year":"2010","unstructured":"Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T.: Finding popular places. Int. J. Comput. Geom. Appl. 20(01), 19\u201342 (2010)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1082\u20131090 (2011)","DOI":"10.1145\/2020408.2020579"},{"issue":"5","key":"46_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4(5), 387\u2013421 (1989). https:\/\/doi.org\/10.1007\/BF02187740","journal-title":"Discrete Comput. Geom."},{"key":"46_CR7","unstructured":"Consuegra, M.E., Narasimhan, G.: Geometric avatar problems. In: Leibniz International Proceedings in Informatics. LIPIcs, vol. 24. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3th Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"3","key":"46_CR9","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. Geom. 11(3), 321\u2013350 (1994). https:\/\/doi.org\/10.1007\/BF02574012","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"46_CR10","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(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"46_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"21","key":"46_CR12","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. Inf. Process. Lett. 111(21), 1054\u20131056 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"46_CR13","first-page":"1300","volume":"26","author":"Z He","year":"2012","unstructured":"He, Z., Lo, E.: Answering why-not questions on top-$$k$$ queries. IEEE Trans. Knowl. Data Eng. 26(6), 1300\u20131315 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"46_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":"46_CR15","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. Combinat. Optim. 26(2), 266\u2013283 (2013)","journal-title":"J. Combinat. Optim."},{"issue":"1","key":"46_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0196-6774(92)90012-2","volume":"13","author":"T Kashiwabara","year":"1992","unstructured":"Kashiwabara, T., Masuda, S., Nakajima, K., Fujisawa, T.: Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph. J. Algorithms 13(1), 161\u2013174 (1992)","journal-title":"J. Algorithms"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ipl.2018.01.007","volume":"135","author":"MR Kazemi","year":"2018","unstructured":"Kazemi, M.R., Mohades, A., Khanteimouri, P.: Approximation algorithms for color spanning diameter. Inf. Process. Lett. 135, 53\u201356 (2018)","journal-title":"Inf. Process. Lett."},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.dam.2019.10.016","volume":"279","author":"MR Kazemi","year":"2020","unstructured":"Kazemi, M.R., Mohades, A., Khanteimouri, P.: On approximability of minimum color-spanning ball in high dimensions. Discret. Appl. Math. 279, 188\u2013191 (2020)","journal-title":"Discret. Appl. Math."},{"key":"46_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.tcs.2020.02.006","volume":"814","author":"V Keikha","year":"2020","unstructured":"Keikha, V., L\u00f6ffler, M., Mohades, A.: A fully polynomial time approximation scheme for the smallest diameter of imprecise points. Theoret. Comput. Sci. 814, 259\u2013270 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"46_CR20","first-page":"478","volume":"100","author":"D-T Lee","year":"1982","unstructured":"Lee, D.-T.: On $$k$$-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput. 100(6), 478\u2013487 (1982)","journal-title":"IEEE Trans. Comput."},{"key":"46_CR21","unstructured":"Leskovec, J., Krevl, A.: Snap datasets: Stanford large network dataset collection (2014)"},{"issue":"4","key":"46_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":"46_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.endm.2018.06.043","volume":"68","author":"Y Manoussakis","year":"2018","unstructured":"Manoussakis, Y., Pham, H.P.: Maximum colorful independent sets in vertex-colored graphs. Electron. Notes Discrete Math. 68, 251\u2013256 (2018)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"46_CR24","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"issue":"4","key":"46_CR25","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14(4), 365\u2013384 (1995). https:\/\/doi.org\/10.1007\/BF02570713","journal-title":"Discrete Comput. Geom."},{"key":"46_CR26","doi-asserted-by":"publisher","unstructured":"Preparata, F.P., Shamos, M.I.: Convex hulls: basic algorithms. In: Computational Geometry. Texts and Monographs in Computer Science, pp. 95\u2013149. Springer, New York (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6_3","DOI":"10.1007\/978-1-4612-1098-6_3"},{"key":"46_CR27","doi-asserted-by":"publisher","first-page":"100550","DOI":"10.1016\/j.disopt.2019.07.001","volume":"34","author":"J Pruente","year":"2019","unstructured":"Pruente, J.: Minimum diameter color-spanning sets revisited. Discrete Optim. 34, 100550 (2019)","journal-title":"Discrete Optim."},{"key":"46_CR28","unstructured":"Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE MELECON, vol. 83, p. A10 (1983)"},{"key":"46_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: Proceedings of the 25th IEEE International Conference on Data Engineering, pp. 688\u2013699 (2009)","DOI":"10.1109\/ICDE.2009.77"}],"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-030-92681-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:08:28Z","timestamp":1639354108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_46","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":"11 December 2021","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":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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.75","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)"}}]}}