{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:48Z","timestamp":1774421328153,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031496134","type":"print"},{"value":"9783031496141","type":"electronic"}],"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-49614-1_16","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"215-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The 2-Mixed-Center Color Spanning Problem"],"prefix":"10.1007","author":[{"given":"Yin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huili","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"16_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"},{"key":"16_CR2","unstructured":"Abellanas, M., et al.: The farthest color voronoi diagram and related problems. In: European Workshop on Computational Geometry, pp. 113\u2013116 (2006)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. In: Proceedings of the Thirteenth Annual Symposium on Computational Geometry, pp. 147\u2013155 (1997)","DOI":"10.1145\/262839.262921"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2018.02.014","volume":"280","author":"S Banerjee","year":"2020","unstructured":"Banerjee, S., Misra, N., Nandy, S.C.: Color spanning objects: algorithms and hardness results. Disc. Appl. Math. 280, 14\u201322 (2020)","journal-title":"Disc. Appl. Math."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2018.08.008","volume":"786","author":"S Bereg","year":"2019","unstructured":"Bereg, S., Ma, F., Wang, W., Zhang, J., Zhu, B.: On some matching problems under the color-spanning model. Theor. Comput. Sci. 786, 26\u201331 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1016\/j.cor.2008.03.009","volume":"36","author":"D Chen","year":"2009","unstructured":"Chen, D., Chen, R.: New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems. Comput. Oper. Res. 36(5), 1646\u20131655 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"05","key":"16_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. Int. J. Comput. Geom. Appl. 19(05), 457\u2013478 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets. In: International Workshop on Frontiers in Algorithmics, pp. 285\u2013292 (2010)","DOI":"10.1007\/978-3-642-14553-7_27"},{"issue":"21\u201322","key":"16_CR9","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\u201322), 1054\u20131056 (2011)","journal-title":"Inf. Process. Lett."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Fortune, S.: A sweepline algorithm for voronoi diagrams. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 313\u2013322 (1986)","DOI":"10.1145\/10515.10549"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(93)90153-Z","volume":"47","author":"J Hershberger","year":"1993","unstructured":"Hershberger, J.: A faster algorithm for the two-center decision problem. Inf. Process. Lett. 47(1), 23\u201329 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"16_CR12","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":"16_CR13","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":"16_CR14","doi-asserted-by":"crossref","unstructured":"Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Computing the smallest color-spanning axis-parallel square. In: International Symposium on Algorithms and Computation, pp. 634\u2013643 (2013)","DOI":"10.1007\/978-3-642-45030-3_59"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s10878-014-9764-7","volume":"29","author":"C Li","year":"2015","unstructured":"Li, C., Fan, C., Luo, J., Zhong, F., Zhu, B.: Expected computations on color spanning sets. J. Comb. Optim. 29(3), 589\u2013604 (2015)","journal-title":"J. Comb. Optim."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Mantas, I., Papadopoulou, E., Sacrist\u00e1n, V., Silveira, R.I.: Farthest color Voronoi diagrams: complexity and algorithms. In: Latin American Symposium on Theoretical Informatics, pp. 283\u2013295 (2021)","DOI":"10.1007\/978-3-030-61792-9_23"},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in r$$^{\\hat{\\,\\,}}$$3 and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Sharir, M.: A near-linear algorithm for the planar 2-center problem. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp. 106\u2013112 (1996)","DOI":"10.1145\/237218.237251"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00454-021-00358-5","volume":"68","author":"H Wang","year":"2022","unstructured":"Wang, H.: On the planar two-center problem and circular hulls. Disc. Comput. Geom. 68, 1\u201352 (2022)","journal-title":"Disc. Comput. Geom."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Wang, Y., Xu, Y., Zhang, H., Tong, W.: Online k-color spanning disk problems (2023)","DOI":"10.1007\/s10878-023-01080-z"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1007\/s10878-017-0183-4","volume":"36","author":"Y Xu","year":"2018","unstructured":"Xu, Y., Peng, J., Xu, Y.: The mixed center location problem. J. Comb. Optim. 36, 1128\u20131144 (2018)","journal-title":"J. Comb. Optim."},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-26626-8_8","volume-title":"Combinatorial Optimization and Applications","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Peng, J., Xu, Y., Zhu, B.: The discrete and mixed minimax 2-center problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 101\u2013109. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_8"},{"key":"16_CR23","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: IEEE 25th 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-031-49614-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:04:03Z","timestamp":1707555843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}