{"id":"https://openalex.org/W4387847413","doi":"https://doi.org/10.1145/3583780.3614878","title":"Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling","display_name":"Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling","publication_year":2023,"publication_date":"2023-10-21","ids":{"openalex":"https://openalex.org/W4387847413","doi":"https://doi.org/10.1145/3583780.3614878"},"language":"en","primary_location":{"id":"doi:10.1145/3583780.3614878","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583780.3614878","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583780.3614878","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3583780.3614878","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092130674","display_name":"Vedangi Bengali","orcid":"https://orcid.org/0000-0002-5891-7933"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vedangi Bengali","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046315164","display_name":"Nate Veldt","orcid":"https://orcid.org/0000-0002-0117-3304"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nate Veldt","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5092130674"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.3497,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66172224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"78","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7929815053939819},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7137516140937805},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7042970061302185},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5905216336250305},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5461578965187073},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4912986159324646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4640789031982422},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.45852676033973694},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3775249719619751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35415118932724},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2407214641571045},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1932353675365448}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7929815053939819},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7137516140937805},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7042970061302185},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5905216336250305},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5461578965187073},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4912986159324646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4640789031982422},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.45852676033973694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3775249719619751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35415118932724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2407214641571045},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1932353675365448},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583780.3614878","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583780.3614878","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583780.3614878","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583780.3614878","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583780.3614878","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583780.3614878","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387847413.pdf","grobid_xml":"https://content.openalex.org/works/W4387847413.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W143174683","https://openalex.org/W1547576067","https://openalex.org/W1572977974","https://openalex.org/W1964846359","https://openalex.org/W1982119153","https://openalex.org/W1985875030","https://openalex.org/W1988153470","https://openalex.org/W2025543856","https://openalex.org/W2035080386","https://openalex.org/W2044988896","https://openalex.org/W2069668029","https://openalex.org/W2071234528","https://openalex.org/W2088844265","https://openalex.org/W2091858563","https://openalex.org/W2107223449","https://openalex.org/W2121947440","https://openalex.org/W2131681506","https://openalex.org/W2143654071","https://openalex.org/W2146081992","https://openalex.org/W2150148016","https://openalex.org/W2416738288","https://openalex.org/W2469279958","https://openalex.org/W2602671714","https://openalex.org/W2611831635","https://openalex.org/W2768986464","https://openalex.org/W2803851338","https://openalex.org/W2893274952","https://openalex.org/W2912935170","https://openalex.org/W2914959486","https://openalex.org/W2948499415","https://openalex.org/W2951271819","https://openalex.org/W2952751130","https://openalex.org/W2995298752","https://openalex.org/W2999177578","https://openalex.org/W3080755825","https://openalex.org/W3082501155","https://openalex.org/W3099768174","https://openalex.org/W3104252707","https://openalex.org/W3118621910","https://openalex.org/W3126033509","https://openalex.org/W3142588439","https://openalex.org/W3169940233","https://openalex.org/W3196292518","https://openalex.org/W4327652396"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W1976468483","https://openalex.org/W2480116122","https://openalex.org/W2563912921","https://openalex.org/W2091368663","https://openalex.org/W1034070228"],"abstract_inverted_index":{"Graph":[0],"clustering":[1,42,58],"is":[2,12,47],"a":[3,50,98,151],"fundamental":[4],"task":[5],"in":[6,127],"network":[7,129],"analysis":[8],"where":[9],"the":[10,28,31,116],"goal":[11],"to":[13,21,27,149],"detect":[14],"sets":[15],"of":[16,30,118,124,135,163],"nodes":[17],"that":[18,89,106,112,158],"are":[19,71,113,123,133],"well-connected":[20],"each":[22],"other":[23,57],"but":[24],"sparsely":[25],"connected":[26],"rest":[29],"graph.":[32],"We":[33,83],"present":[34],"faster":[35],"approximation":[36,76,81,87,141,153,161],"algorithms":[37,70,88,142],"for":[38,155],"an":[39],"NP-hard":[40],"parameterized":[41,100],"framework":[43],"called":[44],"LambdaCC,":[45],"which":[46],"governed":[48],"by":[49],"tunable":[51],"resolution":[52],"parameter":[53],"and":[54,65,122,143],"generalizes":[55,107],"many":[56],"objectives":[59],"such":[60],"as":[61],"modularity,":[62],"sparsest":[63],"cut,":[64],"cluster":[66],"deletion.":[67],"Previous":[68],"LambdaCC":[69],"either":[72],"heuristics":[73,157],"with":[74],"no":[75,160],"guarantees,":[77],"or":[78],"computationally":[79],"expensive":[80],"algorithms.":[82],"provide":[84],"fast":[85],"new":[86,99],"can":[90],"be":[91],"made":[92],"purely":[93],"combinatorial.":[94],"These":[95],"rely":[96],"on":[97,115],"edge":[101,109],"labeling":[102,110],"problem":[103],"we":[104],"introduce":[105],"previous":[108,140,156],"problems":[111],"based":[114],"principle":[117],"strong":[119],"triadic":[120],"closure":[121],"independent":[125],"interest":[126],"social":[128],"analysis.":[130],"Our":[131],"methods":[132],"orders":[134],"magnitude":[136],"more":[137],"scalable":[138],"than":[139],"our":[144],"lower":[145],"bounds":[146],"allow":[147],"us":[148],"obtain":[150],"posteriori":[152],"guarantees":[154,162],"have":[159],"their":[164],"own.":[165]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}