{"id":"https://openalex.org/W4399522872","doi":"https://doi.org/10.1145/3618260.3649747","title":"Approximating Small Sparse Cuts","display_name":"Approximating Small Sparse Cuts","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399522872","doi":"https://doi.org/10.1145/3618260.3649747"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649747","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649747","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649747","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","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/3618260.3649747","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027182434","display_name":"Aditya Anand","orcid":"https://orcid.org/0009-0008-8816-0266"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aditya Anand","raw_affiliation_strings":["University of Michigan, Ann Arbor, USA"],"raw_orcid":"https://orcid.org/0009-0008-8816-0266","affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["University of Michigan, Ann Arbor, USA"],"raw_orcid":"https://orcid.org/0000-0003-1454-7587","affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026118558","display_name":"Jason Li","orcid":"https://orcid.org/0000-0003-3644-0879"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0003-3644-0879","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010547647","display_name":"Thatchaphol Saranurak","orcid":"https://orcid.org/0000-0001-8386-7168"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thatchaphol Saranurak","raw_affiliation_strings":["University of Michigan, Ann Arbor, USA"],"raw_orcid":"https://orcid.org/0000-0001-8386-7168","affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5027182434"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.3457,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59571229,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"8","issue":null,"first_page":"319","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.681630551815033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.654962420463562},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6207035779953003},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5894786715507507},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5871626138687134},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5845704078674316},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5230104327201843},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4392380118370056},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4314410090446472},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41328081488609314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4113554060459137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37301093339920044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20286667346954346}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.681630551815033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.654962420463562},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6207035779953003},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5894786715507507},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5871626138687134},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5845704078674316},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5230104327201843},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4392380118370056},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4314410090446472},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41328081488609314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4113554060459137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37301093339920044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20286667346954346},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649747","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649747","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649747","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649747","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649747","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649747","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399522872.pdf"},"referenced_works_count":66,"referenced_works":["https://openalex.org/W1517065489","https://openalex.org/W1588155622","https://openalex.org/W1787689584","https://openalex.org/W1898392233","https://openalex.org/W1965562201","https://openalex.org/W1971361630","https://openalex.org/W1977360022","https://openalex.org/W1981591809","https://openalex.org/W1984361668","https://openalex.org/W2019404063","https://openalex.org/W2020913456","https://openalex.org/W2028932986","https://openalex.org/W2030365814","https://openalex.org/W2034331023","https://openalex.org/W2038964811","https://openalex.org/W2044343300","https://openalex.org/W2045107949","https://openalex.org/W2049609719","https://openalex.org/W2078013954","https://openalex.org/W2088759008","https://openalex.org/W2088844265","https://openalex.org/W2095727035","https://openalex.org/W2098350988","https://openalex.org/W2106515361","https://openalex.org/W2150148016","https://openalex.org/W2167061810","https://openalex.org/W2169528477","https://openalex.org/W2176446742","https://openalex.org/W2176494464","https://openalex.org/W2179340953","https://openalex.org/W2242403914","https://openalex.org/W2278710066","https://openalex.org/W2327131051","https://openalex.org/W2547436936","https://openalex.org/W2565540516","https://openalex.org/W2571471359","https://openalex.org/W2619061098","https://openalex.org/W2771422378","https://openalex.org/W2807192154","https://openalex.org/W2891457632","https://openalex.org/W2900382700","https://openalex.org/W2903365982","https://openalex.org/W2904185472","https://openalex.org/W2950509221","https://openalex.org/W2951226306","https://openalex.org/W2962780495","https://openalex.org/W2963766025","https://openalex.org/W2964264613","https://openalex.org/W2998970133","https://openalex.org/W3006971664","https://openalex.org/W3014552119","https://openalex.org/W3113894442","https://openalex.org/W3114811052","https://openalex.org/W3135063256","https://openalex.org/W3168285534","https://openalex.org/W4214824051","https://openalex.org/W4230551286","https://openalex.org/W4249586771","https://openalex.org/W4252842032","https://openalex.org/W4281977994","https://openalex.org/W4302769223","https://openalex.org/W4313203312","https://openalex.org/W4327811148","https://openalex.org/W4376639621","https://openalex.org/W4392867002","https://openalex.org/W6672776990"],"related_works":["https://openalex.org/W2543175834","https://openalex.org/W1568947763","https://openalex.org/W25104710","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4287552035","https://openalex.org/W2073435288","https://openalex.org/W4299801389","https://openalex.org/W2047623182","https://openalex.org/W2296729072"],"abstract_inverted_index":{"We":[0,69],"study":[1],"polynomial-time":[2],"approximation":[3,104,158],"algorithms":[4,36],"for":[5,37,60,159],"edge":[6],"and":[7,11,55,92,125,127,173],"vertex":[8,133],"Sparsest":[9],"Cut":[10],"Small":[12],"Set":[13],"Expansion":[14],"in":[15,26,40,67,138,185],"terms":[16],"of":[17,21,48,51,77,89,117,131,135,145,150,169,180],"k,":[18],"the":[19,27,49,98,118,166,170,175,178],"number":[20],"edges":[22],"or":[23],"vertices":[24],"cut":[25],"optimal":[28,171],"solution.":[29],"Our":[30,43,106],"main":[31],"results":[32],"are":[33],"O(polylog":[34],"k)-approximation":[35],"various":[38],"versions":[39],"this":[41,75],"setting.":[42],"techniques":[44,142],"involve":[45],"an":[46,86,129,156],"extension":[47],"notion":[50,76],"sample":[52,78],"sets":[53,79],"(Feige":[54],"Mahdian":[56],"STOC\u201906),":[57],"originally":[58],"developed":[59],"small":[61],"balanced":[62],"cuts,":[63],"to":[64,73,101],"sparse":[65],"cuts":[66],"general.":[68],"then":[70],"show":[71],"how":[72],"combine":[74],"with":[80],"two":[81],"algorithms,":[82],"one":[83],"based":[84,96],"on":[85,97,177],"existing":[87],"framework":[88],"LP":[90],"rounding":[91],"another":[93],"new":[94],"algorithm":[95,109],"cut-matching":[99,107,119],"game,":[100],"get":[102],"such":[103],"algorithms.":[105],"game":[108,120],"can":[110],"be":[111,144],"viewed":[112],"as":[113],"a":[114],"local":[115],"version":[116],"by":[121],"Khandekar,":[122],"Khot,":[123],"Orecchia":[124],"Vishnoi":[126],"certifies":[128],"expansion":[130],"every":[132],"set":[134],"size":[136,179],"s":[137],"O(logs)":[139],"rounds.":[140],"These":[141],"may":[143],"independent":[146],"interest.":[147],"As":[148],"corollaries":[149],"our":[151],"results,":[152],"we":[153],"also":[154],"obtain":[155],"O(logopt)":[157],"min-max":[160,167],"graph":[161],"partitioning,":[162],"where":[163],"opt":[164],"is":[165],"value":[168],"cut,":[172],"improve":[174],"bound":[176],"multicut":[181],"mimicking":[182],"networks":[183],"computable":[184],"polynomial":[186],"time.":[187]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}