{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:42:29Z","timestamp":1746438149345,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"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-93176-6_2","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithm for\u00a0the\u00a0Capacitated Correlation Clustering Problem with\u00a0Penalties"],"prefix":"10.1007","author":[{"given":"Sai","family":"Ji","sequence":"first","affiliation":[]},{"given":"Gaidi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xianzhao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"2_CR1","unstructured":"Aboud, A., Rabani, Y.: Correlation clustering with penalties and approximating the reordering buffer management problem. Doctoral dissertation, Computer Science Department, Technion (2008)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-17953-3_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Ahmadi","year":"2019","unstructured":"Ahmadi, S., Khuller, S., Saha, B.: Min-max correlation clustering via multicut. In: Lodi, A., Nagarajan, V. (eds.) IPCO 2019. LNCS, vol. 11480, pp. 13\u201326. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_2"},{"key":"2_CR3","unstructured":"Ahn, K.J., Cormode, G., Guha, S., Mcgregor, A., Wirth, A.: Correlation clustering in data streams. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 2237\u20132246 (2015)"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1137\/110848712","volume":"41","author":"N Ailon","year":"2012","unstructured":"Ailon, N., Avigdor-Elgrabli, N., Liberty, E., Zuylen, A.V.: Improved approximation algorithms for bipartite correlation clustering. SIAM J. Comput. 41(5), 1110\u20131121 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"2_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"2_CR6","unstructured":"Bressan, M., Cesa-Bianchi, N., Paudice, A., Vitale, F.: Correlation clustering with adaptive similarity queries. In: Proceedings of the 32nd Annual Conference on Neural Information Processing Systems, pp. 12510\u201312519 (2019)"},{"issue":"1\u20132","key":"2_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10107-016-1067-6","volume":"163","author":"J Castro","year":"2017","unstructured":"Castro, J., Nasini, S., Saldanha-Da-Gama, F.: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math. Program. 163(1\u20132), 411\u2013444 (2017)","journal-title":"Math. Program."},{"issue":"71","key":"2_CR8","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"3","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 3(71), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chawla, S., Makarychev, K., Schramm, T., Yaroslavtsev, G.: Near optimal LP rounding algorithm for correlation clustering on complete and complete $$k$$-partite graphs. In: Proceedings of the 47th ACM Symposium on Theory of Computing, pp. 219\u2013228 (2015)","DOI":"10.1145\/2746539.2746604"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X., Hu, X., Jia, X., Li, M., Tang, Z., Wang, C.: Mechanism design for two-opposite-facility location games with penalties on distance. In: Proceedings of the 10th International Symposium on Algorithmic Game Theory, pp. 256\u2013260 (2018)","DOI":"10.1007\/978-3-319-99660-8_24"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2241\u20132259 (2020)","DOI":"10.1137\/1.9781611975994.138"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.ejor.2019.07.045","volume":"289","author":"C Filippi","year":"2021","unstructured":"Filippi, C., Guastaroba, G., Speranza, M.G.: On single-source capacitated facility location with cost and fairness objectives. Eur. J. Oper. Res. 289(3), 959\u2013974 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR13","unstructured":"Jafarov, J., Kalhan, S., Makarychev, K., Makarychev, Y.: Correlation clustering with asymmetric classification errors. In: Proceedings of the 37th International Conference on Machine Learning, pp. 4641\u20134650 (2020)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2019.01.003","volume":"264","author":"S Ji","year":"2019","unstructured":"Ji, S., Xu, D., Du, D., Wu, C.: Approximation algorithms for the fault-tolerant facility location problem with penalties. Discret. Appl. Math. 264, 62\u201375 (2019)","journal-title":"Discret. Appl. Math."},{"key":"2_CR15","unstructured":"Lange, J.H., Karrenbauer, A., Andres, B.: Partial optimality and fast lower bounds for weighted correlation clustering. In: Proceedings of the 35th International Conference on International Conference on Machine Learning, pp. 2892\u20132901 (2018)"},{"issue":"5","key":"2_CR16","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1109\/TIT.2019.2940246","volume":"66","author":"P Li","year":"2019","unstructured":"Li, P., Puleo, G.J., Milenkovic, O.: Motif and hypergraph correlation clustering. IEEE Trans. Inf. Theory 66(5), 3065\u20133078 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1137\/140994198","volume":"25","author":"GJ Puleo","year":"2015","unstructured":"Puleo, G.J., Milenkovic, O.: Correlation clustering with constrained cluster sizes and extended weights bounds. SIAM J. Optim. 25(3), 1857\u20131872 (2015)","journal-title":"SIAM J. Optim."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Thiel, E., Chehreghani, M.H., Dubhashi, D.: A non-convex optimization approach to correlation clustering. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, pp. 5159\u20135166 (2019)","DOI":"10.1609\/aaai.v33i01.33015159"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11081-020-09503-0","volume":"21","author":"Y Xu","year":"2020","unstructured":"Xu, Y., M\u00f6hring, R.H., Xu, D., Zhang, Y., Zou, Y.: A constant FPT approximation algorithm for hard-capacitated $$k$$-means. Optim. Eng. 21(2), 709\u2013722 (2020)","journal-title":"Optim. Eng."},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10878-018-0278-6","volume":"37","author":"D Zhang","year":"2019","unstructured":"Zhang, D., Hao, C., Wu, C., Xu, D., Zhang, Z.: Local search approximation algorithms for the $$k$$-means problem with penalties. J. Comb. Optim. 37(2), 439\u2013453 (2019)","journal-title":"J. Comb. Optim."}],"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-3-030-93176-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:44:14Z","timestamp":1641015854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_2","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":"17 December 2021","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 Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 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":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","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":"OCS","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":"38","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":"61% - 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":"3","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)"}}]}}