{"id":"https://openalex.org/W3162002837","doi":"https://doi.org/10.1145/3604797","title":"Parameterized Complexity of Feature Selection for Categorical Data Clustering","display_name":"Parameterized Complexity of Feature Selection for Categorical Data Clustering","publication_year":2023,"publication_date":"2023-09-01","ids":{"openalex":"https://openalex.org/W3162002837","doi":"https://doi.org/10.1145/3604797","mag":"3162002837"},"language":"en","primary_location":{"id":"doi:10.1145/3604797","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3604797","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3604797","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3604797","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001388244","display_name":"Sayan Bandyapadhyay","orcid":"https://orcid.org/0000-0001-8875-0102"},"institutions":[{"id":"https://openalex.org/I126345244","display_name":"Portland State University","ror":"https://ror.org/00yn2fy02","country_code":"US","type":"education","lineage":["https://openalex.org/I126345244"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sayan Bandyapadhyay","raw_affiliation_strings":["Department of Computer Science, Portland State University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Portland State University, USA","institution_ids":["https://openalex.org/I126345244"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102983476","display_name":"Kirill Simonov","orcid":"https://orcid.org/0000-0001-9436-7310"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]},{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kirill Simonov","raw_affiliation_strings":["Hasso Plattner Institute, University of Potsdam, Germany"],"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, University of Potsdam, Germany","institution_ids":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5001388244"],"corresponding_institution_ids":["https://openalex.org/I126345244"],"apc_list":null,"apc_paid":null,"fwci":1.094,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69827523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"15","issue":"3-4","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.992900013923645,"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/cluster-analysis","display_name":"Cluster analysis","score":0.8112320303916931},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7362635731697083},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6318618655204773},{"id":"https://openalex.org/keywords/categorical-variable","display_name":"Categorical variable","score":0.6211487054824829},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.5522246956825256},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5270070433616638},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.5171786546707153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48441651463508606},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.45357051491737366},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.45005863904953003},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4356682300567627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42370718717575073},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4162675142288208},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41611504554748535},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.4122253358364105},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.3749261498451233},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3635990023612976},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.36105823516845703},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.348052442073822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.303338885307312},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.24453598260879517},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21454179286956787},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.20391613245010376}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8112320303916931},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7362635731697083},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6318618655204773},{"id":"https://openalex.org/C5274069","wikidata":"https://www.wikidata.org/wiki/Q2285707","display_name":"Categorical variable","level":2,"score":0.6211487054824829},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.5522246956825256},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5270070433616638},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5171786546707153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48441651463508606},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.45357051491737366},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.45005863904953003},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4356682300567627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42370718717575073},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4162675142288208},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41611504554748535},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.4122253358364105},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.3749261498451233},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3635990023612976},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.36105823516845703},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.348052442073822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.303338885307312},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.24453598260879517},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21454179286956787},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.20391613245010376},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3604797","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3604797","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3604797","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:pdxscholar.library.pdx.edu:compsci_fac-1355","is_oa":false,"landing_page_url":"https://pdxscholar.library.pdx.edu/compsci_fac/349","pdf_url":null,"source":{"id":"https://openalex.org/S4377196300","display_name":"PDXScholar  (Portland State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126345244","host_organization_name":"Portland State University","host_organization_lineage":["https://openalex.org/I126345244"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty Publications and Presentations","raw_type":"text"},{"id":"pmh:oai:bora.uib.no:11250/2928922","is_oa":true,"landing_page_url":"https://hdl.handle.net/11250/2928922","pdf_url":null,"source":{"id":"https://openalex.org/S4306401716","display_name":"Duo Research Archive (University of Oslo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184942183","host_organization_name":"University of Oslo","host_organization_lineage":["https://openalex.org/I184942183"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"14","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3604797","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3604797","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3604797","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2493728679","display_name":null,"funder_award_id":"DFG 411362735","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3748656914","display_name":null,"funder_award_id":"Norway","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G5399623649","display_name":null,"funder_award_id":"314528","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G7697800524","display_name":null,"funder_award_id":"411362735","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3162002837.pdf","grobid_xml":"https://content.openalex.org/works/W3162002837.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W56210758","https://openalex.org/W1555055825","https://openalex.org/W1613169971","https://openalex.org/W1966616869","https://openalex.org/W1986170391","https://openalex.org/W1995725694","https://openalex.org/W2016602956","https://openalex.org/W2019404372","https://openalex.org/W2116087731","https://openalex.org/W2126690312","https://openalex.org/W2133157266","https://openalex.org/W2135940344","https://openalex.org/W2145962650","https://openalex.org/W2157795846","https://openalex.org/W2158312129","https://openalex.org/W2160342152","https://openalex.org/W2166630570","https://openalex.org/W2171887548","https://openalex.org/W2296148711","https://openalex.org/W2398336627","https://openalex.org/W2503308866","https://openalex.org/W2608141914","https://openalex.org/W2798801347","https://openalex.org/W2802074115","https://openalex.org/W2907115276","https://openalex.org/W2914414140","https://openalex.org/W2956154753","https://openalex.org/W2962768932","https://openalex.org/W2962963658","https://openalex.org/W2963651520","https://openalex.org/W2971886964","https://openalex.org/W2977536198","https://openalex.org/W2986926078","https://openalex.org/W2991478127","https://openalex.org/W2997064440","https://openalex.org/W3100384259","https://openalex.org/W3112236022","https://openalex.org/W3122766110","https://openalex.org/W6633235618","https://openalex.org/W6678521032","https://openalex.org/W6891721752"],"related_works":["https://openalex.org/W1984545523","https://openalex.org/W4241767317","https://openalex.org/W2188840951","https://openalex.org/W2101637161","https://openalex.org/W2056194206","https://openalex.org/W2171610853","https://openalex.org/W3092684173","https://openalex.org/W2160785859","https://openalex.org/W2551482053","https://openalex.org/W1999117613"],"abstract_inverted_index":{"We":[0,41,47,202,372],"develop":[1],"new":[2],"algorithmic":[3,376],"methods":[4,38],"with":[5,296,329,356,378],"provable":[6],"guarantees":[7],"for":[8,95,255,281,368],"feature":[9,18,36],"selection":[10,19,37],"in":[11,30,238],"regard":[12],"to":[13,27,71,129,138,209,289,303],"categorical":[14,118,343],"data":[15,60,81,119,344],"clustering.":[16,67],"While":[17],"is":[20,85,167,192,229,267,284,331],"one":[21],"of":[22,33,57,66,75,101,108,116,133,148,164,170,180,183,196,199,206,214,308,362],"the":[23,34,43,58,64,76,80,90,146,162,168,177,181,184,193,197,200,204,212,215,234,265,312],"most":[24,32],"common":[25],"approaches":[26],"reduce":[28],"dimensionality":[29],"practice,":[31],"known":[35],"are":[39,51,277],"heuristics.":[40],"study":[42],"following":[44],"mathematical":[45],"model.":[46],"assume":[48],"that":[49,61,83,145,232,311,332],"there":[50,84],"some":[52,256],"inadvertent":[53],"(or":[54],"undesirable)":[55],"features":[56,78,143,155,179],"input":[59],"unnecessarily":[62],"increase":[63],"cost":[65,147,163,191],"Consequently,":[68],"we":[69,136,301,365],"want":[70,137,302],"select":[72,139],"a":[73,86,114,130,165,287,290,305,360],"subset":[74],"original":[77],"from":[79],"such":[82,144,310,345],"small-cost":[87],"clustering":[88,190],"on":[89,153,218,286],"selected":[91,178],"features.":[92],"More":[93],"precisely,":[94],"given":[96],"integers":[97],"\u2113":[98],"(the":[99,106],"number":[100,107,307],"irrelevant":[102],"features)":[103],"and":[104,113,186,224,259,275,349,351],"k":[105,151,220,249,276],"clusters),":[109],"budget":[110],"B":[111,159,222,243,272],",":[112,221,223,244,250],"set":[115,132],"n":[117,253],"points":[120,314],"(represented":[121],"by":[122,271],"m":[123,140,246],"-dimensional":[124],"vectors":[125],"whose":[126],"elements":[127,182],"belong":[128],"finite":[131],"values":[134],"\u03a3),":[135],"-\u2113":[141],"relevant":[142],"any":[149],"optimal":[150],"-clustering":[152],"these":[154,370],"does":[156],"not":[157],"exceed":[158],".":[160,261],"Here":[161],"cluster":[166,185],"sum":[169,195],"Hamming":[171],"distances":[172],"(\u2113":[173],"0":[174],"-distances)":[175],"between":[176],"its":[187],"center.":[188],"The":[189],"total":[194],"costs":[198],"clusters.":[201],"use":[203],"framework":[205],"parameterized":[207,270],"complexity":[208,213,379],"identify":[210],"how":[211],"problem":[216,237,266],"depends":[217],"parameters":[219],"|\u03a3|.":[225],"Our":[226,279],"main":[227],"result":[228],"an":[230],"algorithm":[231,280],"solves":[233],"Feature":[235,282,334],"Selection":[236,283],"time":[239],"f":[240,258],"(":[241,248],"k,":[242],"|\u03a3|)\u22c5":[245],"g":[247,260],"|\u03a3|)":[251],"\u22c5":[252],"2":[254],"functions":[257],"In":[262,298],"other":[263,339],"words,":[264],"fixed-parameter":[268],"tractable":[269],"when":[273],"|\u03a3|":[274],"constants.":[278],"based":[285],"solution":[288],"more":[291],"general":[292],"problem,":[293,300],"Constrained":[294,327],"Clustering":[295,328,348],"Outliers.":[297,357],"this":[299],"delete":[304],"certain":[306],"outliers":[309],"remaining":[313],"could":[315],"be":[316],"clustered":[317],"around":[318],"centers":[319],"satisfying":[320],"specific":[321],"constraints.":[322],"One":[323],"interesting":[324],"fact":[325],"about":[326],"Outliers":[330],"besides":[333],"Selection,":[335],"it":[336],"encompasses":[337],"many":[338],"fundamental":[340],"problems":[341],"regarding":[342],"as":[346,359],"Robust":[347],"Binary":[350],"Boolean":[352],"Low-rank":[353],"Matrix":[354],"Approximation":[355],"Thus,":[358],"byproduct":[361],"our":[363,375],"theorem,":[364],"obtain":[366],"algorithms":[367],"all":[369],"problems.":[371],"also":[373],"complement":[374],"findings":[377],"lower":[380],"bounds.":[381]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}