{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:41:54Z","timestamp":1742967714424,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777976"},{"type":"electronic","value":"9789819777983"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-981-97-7798-3_8","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"84-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parity-Constrained Weighted k-Center"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3366-9845","authenticated-orcid":false,"given":"Xinlan","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8610-2769","authenticated-orcid":false,"given":"Lu","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6536-0328","authenticated-orcid":false,"given":"Lili","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10107-014-0857-y","volume":"154","author":"HC An","year":"2015","unstructured":"An, H.C., Bhaskara, A., Chekuri, C., Gupta, S., Madan, V., Svensson, O.: Centrality of trees for capacitated $$k$$-center. Math. Program. 154(1), 29\u201353 (2015)","journal-title":"Math. Program."},{"key":"8_CR2","unstructured":"Bajpai, T., Chakrabarty, D., Chekuri, C., Negahbani, M.: Revisiting priority $$k$$-center: fairness and outliers. In: Proceedings of the International Colloquium on Automata, Languages, and Programming, No. 21, pp. 21:1\u201321:20 (2021)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bateni, M., Esfandiari, H., Fischer, M., Mirrokni, V.: Extreme $$k$$-center clustering. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a035, pp. 3941\u20133949 (2021)","DOI":"10.1609\/aaai.v35i5.16513"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3392720","volume":"16","author":"D Chakrabarty","year":"2020","unstructured":"Chakrabarty, D., Goyal, P., Krishnaswamy, R.: The non-uniform $$k$$-center problem. ACM Trans. Algorithms 16(4), 1\u201319 (2020)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Ji, S., Wu, C., Xu, Y., Yang, Y.: An approximation algorithm for diversity-aware fair $$k$$-supplier problem. Theor. Comput. Sci. 114305 (2023)","DOI":"10.1016\/j.tcs.2023.114305"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Xu, D., Xu, Y., Zhang, Y.: Parameterized approximation algorithms for sum of radii clustering and variants. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 18, pp. 20666\u201320673 (2024)","DOI":"10.1609\/aaai.v38i18.30053"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s004930200003","volume":"22","author":"A Frank","year":"2002","unstructured":"Frank, A., Kir\u00e1ly, Z.: Graph orientations with edge-connection and parity constraints. Combinatorica 22, 47\u201370 (2002)","journal-title":"Combinatorica"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02579139","volume":"4","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Corrigendum to our paper \u201cthe ellipsoid method and its consequences in combinatorial optimization\u2019\u2019. Combinatorica 4(4), 291\u2013295 (1984)","journal-title":"Combinatorica"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10898-022-01195-3","volume":"87","author":"L Han","year":"2023","unstructured":"Han, L., Xu, D., Xu, Y., Yang, P.: Approximation algorithms for the individually fair $$k$$-center with outliers. J. Global Optim. 87(2), 603\u2013618 (2023)","journal-title":"J. Global Optim."},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the $$k$$-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3), 533\u2013550 (1986)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"8_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant $$k$$-center problems. Theoret. Comput. Sci. 242(1\u20132), 237\u2013245 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated $$k$$-center problem. SIAM J. Discret. Math. 13(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discret. Math."},{"issue":"7","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1007\/s00453-022-01060-5","volume":"85","author":"K Kim","year":"2023","unstructured":"Kim, K., Shin, Y., An, H.C.: Constant-factor approximation algorithms for parity-constrained facility location and $$k$$-center. Algorithmica 85(7), 1883\u20131911 (2023)","journal-title":"Algorithmica"},{"key":"8_CR17","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair $$k$$-center clustering for data summarization. In: Proceedings of the International Conference on Machine Learning, pp. 3448\u20133457 (2019)"},{"issue":"8","key":"8_CR18","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/ac1897","volume":"23","author":"M Lanthaler","year":"2021","unstructured":"Lanthaler, M., Lechner, W.: Minimal constraints in the parity formulation of optimization problems. New J. Phys. 23(8), 083039 (2021)","journal-title":"New J. Phys."},{"issue":"1\u20133","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2004.08.010","volume":"332","author":"A Lim","year":"2005","unstructured":"Lim, A., Rodrigues, B., Wang, F., Xu, Z.: $$k$$-center problems with minimum coverage. Theoret. Comput. Sci. 332(1\u20133), 1\u201317 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Tong, P., Lawler, E.L., Vazirani, V.V.: Solving the weighted parity problem for gammoids by reduction to graphic matching. In: Progress in Combinatorial Optimization, pp. 363\u2013374 (1984)","DOI":"10.1016\/B978-0-12-566780-7.50026-X"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s00453-023-01158-4","volume":"86","author":"Y Xu","year":"2024","unstructured":"Xu, Y., Chau, V., Wu, C., Zhang, Y., Zissimopoulos, V., Zou, Y.: A semi brute-force search approach for (balanced) clustering. Algorithmica 86(1), 130\u2013146 (2024)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7798-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:06:09Z","timestamp":1726769169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7798-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819777976","9789819777983"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7798-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}