{"id":"https://openalex.org/W7119090225","doi":"https://doi.org/10.1137/1.9781611978964.41","title":"A Simple and Fast \\((3 + \\varepsilon)\\)-approximation for Constrained Correlation Clustering","display_name":"A Simple and Fast \\((3 + \\varepsilon)\\)-approximation for Constrained Correlation Clustering","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7119090225","doi":"https://doi.org/10.1137/1.9781611978964.41"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978964.41","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.41","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046315164","display_name":"Nate Veldt","orcid":"https://orcid.org/0000-0002-0117-3304"},"institutions":[{"id":"https://openalex.org/I2801613365","display_name":"Mitchell Institute","ror":"https://ror.org/03ds72003","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2801613365"]},{"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":"Nate Veldt","raw_affiliation_strings":["Texas A&M University"],"affiliations":[{"raw_affiliation_string":"Texas A&M University","institution_ids":["https://openalex.org/I2801613365","https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046315164"],"corresponding_institution_ids":["https://openalex.org/I2801613365","https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34615385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"492","last_page":"511"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2206999957561493,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2206999957561493,"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"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.21400000154972076,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.12610000371932983,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7662000060081482},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6062999963760376},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47859999537467957},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4390999972820282},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42160001397132874},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4207000136375427},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3901999890804291},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.35740000009536743}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7662000060081482},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6062999963760376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5909000039100647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.553600013256073},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47859999537467957},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4390999972820282},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42160001397132874},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4207000136375427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3901999890804291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37529999017715454},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2874999940395355},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.2524000108242035},{"id":"https://openalex.org/C117220453","wikidata":"https://www.wikidata.org/wiki/Q5172842","display_name":"Correlation","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978964.41","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978964.41","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,115],"Constrained":[1],"Correlation":[2],"Clustering,":[3],"the":[4,18,26,80,135,141],"goal":[5],"is":[6,75],"to":[7,39,84,101,139,146],"cluster":[8,40],"a":[9,14,53,122],"complete":[10],"signed":[11],"graph":[12],"in":[13,111],"way":[15],"that":[16,74,158],"minimizes":[17],"number":[19,27],"of":[20,28,113],"negative":[21],"edges":[22,30],"inside":[23],"clusters":[24],"plus":[25],"positive":[29],"between":[31],"clusters,":[32],"while":[33],"respecting":[34],"hard":[35],"constraints":[36],"on":[37,120],"how":[38],"certain":[41],"friendly":[42,161],"or":[43,162],"hostile":[44,164],"node":[45],"pairs.":[46],"Fischer":[47],"et":[48],"al.":[49],"[FKKT25]":[50],"recently":[51],"developed":[52],"\\(\\tilde{\\mathcal":[54],"O}(n^3)\\)-time":[55],"16-approximation":[56],"algorithm":[57,73,145],"for":[58,88,156],"this":[59],"problem.":[60],"We":[61],"settle":[62],"an":[63,72,147],"open":[64],"question":[65],"posed":[66],"by":[67,70],"these":[68],"authors":[69],"designing":[71],"equally":[76],"fast":[77],"but":[78],"brings":[79],"approximation":[81],"factor":[82],"down":[83],"(\\(3":[85],"+":[86],"\\varepsilon\\))":[87],"arbitrary":[89],"constant":[90],"\\(\\varepsilon":[91],"\\gt":[92],"0\\).":[93],"Although":[94],"several":[95],"new":[96],"algorithmic":[97],"steps":[98],"are":[99],"needed":[100],"obtain":[102],"our":[103,106],"improved":[104],"approximation,":[105],"approach":[107],"maintains":[108],"many":[109],"advantages":[110],"terms":[112],"simplicity.":[114],"particular,":[116],"it":[117],"relies":[118],"mainly":[119],"rounding":[121,136],"(new)":[123],"covering":[124],"linear":[125],"program,":[126],"which":[127],"can":[128],"be":[129],"approximated":[130],"quickly":[131],"and":[132],"combinatorially.":[133],"Furthermore,":[134],"step":[137],"amounts":[138],"applying":[140],"very":[142],"familiar":[143],"\\(\\mathsf{Pivot}\\)":[144],"auxiliary":[148],"graph.":[149],"Finally,":[150],"we":[151],"develop":[152],"much":[153],"simpler":[154],"algorithms":[155],"instances":[157],"involve":[159],"only":[160,163],"constraints.":[165]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}