{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:47:15Z","timestamp":1778827635822,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3614878","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:42Z","timestamp":1697874342000},"page":"78-87","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5891-7933","authenticated-orcid":false,"given":"Vedangi","family":"Bengali","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0117-3304","authenticated-orcid":false,"given":"Nate","family":"Veldt","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Community Detection and Stochastic Block Models: Recent Developments","volume":"18","author":"Abbe Emmanuel","year":"2018","unstructured":"Emmanuel Abbe . 2018 . Community Detection and Stochastic Block Models: Recent Developments . Journal of Machine Learning Research , Vol. 18 , 177 (2018), 1 -- 86 . Emmanuel Abbe. 2018. Community Detection and Stochastic Block Models: Recent Developments. Journal of Machine Learning Research, Vol. 18, 177 (2018), 1--86.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00673-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/110848712"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_7_1","first-page":"27","article-title":"A local-ratio theorem for approximating the weighted vertex cover problem","volume":"25","author":"Bar-Yehuda Reuven","year":"1985","unstructured":"Reuven Bar-Yehuda and Shimon Even . 1985 . A local-ratio theorem for approximating the weighted vertex cover problem . Annals of Discrete Mathematics , Vol. 25 , 27 -- 46 (1985), 50. Reuven Bar-Yehuda and Shimon Even. 1985. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, Vol. 25, 27--46 (1985), 50.","journal-title":"Annals of Discrete Mathematics"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1089\/106652799318274"},{"key":"e_1_3_2_1_9_1","volume-title":"Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. arXiv preprint arXiv:2306.04884","author":"Bengali Vedangi","year":"2023","unstructured":"Vedangi Bengali and Nate Veldt . 2023. Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. arXiv preprint arXiv:2306.04884 ( 2023 ). Vedangi Bengali and Nate Veldt. 2023. Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. arXiv preprint arXiv:2306.04884 (2023)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_11_1","volume-title":"Measuring Scholarly Impact","author":"Bohlin Ludvig","unstructured":"Ludvig Bohlin , Daniel Edler , Andrea Lancichinetti , and Martin Rosvall . 2014. Community detection and visualization of networks with the map equation framework . In Measuring Scholarly Impact . Springer , 3--34. Ludvig Bohlin, Daniel Edler, Andrea Lancichinetti, and Martin Rosvall. 2014. Community detection and visualization of networks with the map equation framework. In Measuring Scholarly Impact. Springer, 3--34."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238225"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746604"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424305"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0903215107"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.008"},{"key":"e_1_3_2_1_19_1","volume-title":"Networks, crowds, and markets","author":"Easley David","unstructured":"David Easley and Jon Kleinberg . 2010. Networks, crowds, and markets . Vol. 8 . Cambridge university press Cambridge . David Easley and Jon Kleinberg. 2010. Networks, crowds, and markets. Vol. 8. Cambridge university press Cambridge."},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. 1001--1010","author":"Fleischer Lisa","year":"2004","unstructured":"Lisa Fleischer . 2004 . A fast approximation scheme for fractional covering problems with variable upper bounds . In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. 1001--1010 . Lisa Fleischer. 2004. A fast approximation scheme for fractional covering problems with variable upper bounds. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. 1001--1010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_3_2_1_22_1","volume-title":"Graph Clustering in All Parameter Regimes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS '20","volume":"15","author":"Gan Junhao","year":"2020","unstructured":"Junhao Gan , David F. Gleich , Nate Veldt , Anthony Wirth , and Xin Zhang . 2020 . Graph Clustering in All Parameter Regimes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS '20 , Vol. 170). 39:1--39: 15 . https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.39 10.4230\/LIPIcs.MFCS.2020.39 Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, and Xin Zhang. 2020. Graph Clustering in All Parameter Regimes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS '20, Vol. 170). 39:1--39:15. https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.39"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings 12","author":"Garg Naveen","year":"2004","unstructured":"Naveen Garg and Rohit Khandekar . 2004 . Fractional covering with upper bounds on the variables: Solving LPs with negative entries. In Algorithms--ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14--17, 2004 . Proceedings 12 . Springer, 371--382. Naveen Garg and Rohit Khandekar. 2004. Fractional covering with upper bounds on the variables: Solving LPs with negative entries. In Algorithms--ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14--17, 2004. Proceedings 12. Springer, 371--382."},{"key":"e_1_3_2_1_24_1","volume-title":"Correlation Clustering Generalized. In 29th International Symposium on Algorithms and Computation (ISAAC 2018","volume":"13","author":"Gleich David F.","year":"2018","unstructured":"David F. Gleich , Nate Veldt , and Anthony Wirth . 2018 . Correlation Clustering Generalized. In 29th International Symposium on Algorithms and Computation (ISAAC 2018 , Vol. 123). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 44:1--44: 13 . https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.44 10.4230\/LIPIcs.ISAAC.2018.44 David F. Gleich, Nate Veldt, and Anthony Wirth. 2018. Correlation Clustering Generalized. In 29th International Symposium on Algorithms and Computation (ISAAC 2018, Vol. 123). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 44:1--44:13. https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.44"},{"key":"e_1_3_2_1_25_1","volume-title":"The strength of weak ties. American journal of sociology","author":"Granovetter Mark S","year":"1973","unstructured":"Mark S Granovetter . 1973. The strength of weak ties. American journal of sociology , Vol. 78 , 6 ( 1973 ), 1360--1380. Mark S Granovetter. 1973. The strength of weak ties. American journal of sociology, Vol. 78, 6 (1973), 1360--1380."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00617-1"},{"key":"e_1_3_2_1_27_1","volume-title":"On Strong Triadic Closure with Edge Insertion. Technical report","author":"Gr\u00fcttemeier Niels","year":"2020","unstructured":"Niels Gr\u00fcttemeier and Nils Morawietz . 2020. On Strong Triadic Closure with Edge Insertion. Technical report ( 2020 ). Niels Gr\u00fcttemeier and Nils Morawietz. 2020. On Strong Triadic Closure with Edge Insertion. Technical report (2020)."},{"key":"e_1_3_2_1_28_1","unstructured":"LLC Gurobi Optimization. 2021. Gurobi optimizer reference manual.  LLC Gurobi Optimization. 2021. Gurobi optimizer reference manual."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451058"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.05.012"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_1_33_1","volume-title":"Finding community structure in networks using the eigenvectors of matrices. Physical review E","author":"Newman Mark EJ","year":"2006","unstructured":"Mark EJ Newman . 2006. Finding community structure in networks using the eigenvectors of matrices. Physical review E , Vol. 74 , 3 ( 2006 ), 036104. Mark EJ Newman. 2006. Finding community structure in networks using the eigenvectors of matrices. Physical review E, Vol. 74, 3 (2006), 036104."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.94.052315"},{"key":"e_1_3_2_1_35_1","volume-title":"Finding and evaluating community structure in networks. Physical review E","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan . 2004. Finding and evaluating community structure in networks. Physical review E , Vol. 69 , 2 ( 2004 ), 026113. Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E, Vol. 69, 2 (2004), 026113."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26390-3_5"},{"key":"e_1_3_2_1_37_1","first-page":"1082","article-title":"Communities in networks","volume":"56","author":"Porter Mason A","year":"2009","unstructured":"Mason A Porter , Jukka-Pekka Onnela , and Peter J Mucha . 2009 . Communities in networks . Notices of the AMS , Vol. 56 , 9 (2009), 1082 -- 1097 . Mason A Porter, Jukka-Pekka Onnela, and Peter J Mucha. 2009. Communities in networks. Notices of the AMS, Vol. 56, 9 (2009), 1082--1097.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976014.11"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.026112"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.01.007"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476282"},{"key":"e_1_3_2_1_44_1","first-page":"8","article-title":"Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence","volume":"22","author":"Shi Jianbo","year":"2000","unstructured":"Jianbo Shi and J. Malik . 2000 . Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence , IEEE Transactions on , Vol. 22 , 8 (August 2000), 888--905. https:\/\/doi.org\/10.1109\/34.868688 10.1109\/34.868688 Jianbo Shi and J. Malik. 2000. Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 22, 8 (August 2000), 888--905. https:\/\/doi.org\/10.1109\/34.868688","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623664"},{"key":"e_1_3_2_1_46_1","volume-title":"From Louvain to","author":"Traag Vincent A","year":"2019","unstructured":"Vincent A Traag , Ludo Waltman , and Nees Jan Van Eck . 2019. From Louvain to Leiden : guaranteeing well-connected communities. Scientific reports, Vol. 9 , 1 ( 2019 ), 5233. Vincent A Traag, Ludo Waltman, and Nees Jan Van Eck. 2019. From Louvain to Leiden: guaranteeing well-connected communities. Scientific reports, Vol. 9, 1 (2019), 5233."},{"key":"e_1_3_2_1_47_1","volume-title":"Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications","author":"Traud Amanda L","year":"2012","unstructured":"Amanda L Traud , Peter J Mucha , and Mason A Porter . 2012. Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications , Vol. 391 , 16 ( 2012 ), 4165--4180. Amanda L Traud, Peter J Mucha, and Mason A Porter. 2012. Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications, Vol. 391, 16 (2012), 4165--4180."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0385"},{"key":"e_1_3_2_1_49_1","volume-title":"International Conference on Machine Learning. PMLR, 22060--22083","author":"Veldt Nate","year":"2022","unstructured":"Nate Veldt . 2022 . Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds . In International Conference on Machine Learning. PMLR, 22060--22083 . Nate Veldt. 2022. Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds. In International Conference on Machine Learning. PMLR, 22060--22083."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186110"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313471"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1217152"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403238"}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614878","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3614878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:57Z","timestamp":1750178217000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":53,"alternative-id":["10.1145\/3583780.3614878","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3614878","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}