{"id":"https://openalex.org/W2179340953","doi":"https://doi.org/10.1137/120873996","title":"Min-Max Graph Partitioning and Small Set Expansion","display_name":"Min-Max Graph Partitioning and Small Set Expansion","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2179340953","doi":"https://doi.org/10.1137/120873996","mag":"2179340953"},"language":"en","primary_location":{"id":"doi:10.1137/120873996","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120873996","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/ae03f43a-d42e-4409-82a9-3990d7df3759","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013190102","display_name":"Uriel Feige","orcid":"https://orcid.org/0009-0006-3749-4392"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uriel Feige","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033681881","display_name":"Konstantin Makarychev","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konstantin Makarychev","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond, WA 98052"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond, WA 98052","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["Computer Science Dept., Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept., Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097149856","display_name":"Joseph Seffi","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Seffi","raw_affiliation_strings":["IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roy Schwartz","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond, WA 98052"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond, WA 98052","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":4.3868,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94904164,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"43","issue":"2","first_page":"872","last_page":"904"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8101356029510498},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7105109691619873},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6066136360168457},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5697277784347534},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5007491111755371},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46856027841567993},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.45448020100593567},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4512906074523926},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.44547581672668457},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.424643337726593}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8101356029510498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7105109691619873},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6066136360168457},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5697277784347534},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5007491111755371},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46856027841567993},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.45448020100593567},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4512906074523926},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.44547581672668457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.424643337726593},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/120873996","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120873996","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/ae03f43a-d42e-4409-82a9-3990d7df3759","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/ae03f43a-d42e-4409-82a9-3990d7df3759","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Feige, U, Krauthgamer, R, Makarychev, K, Nagarajan, V, Naor, J & Schwartz, R 2014, 'Min-max graph partitioning and small set expansion', SIAM Journal on Computing, vol. 43, no. 2, pp. 872-904. https://doi.org/10.1137/120873996","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/ae03f43a-d42e-4409-82a9-3990d7df3759","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/ae03f43a-d42e-4409-82a9-3990d7df3759","pdf_url":"https://research.tue.nl/nl/publications/ae03f43a-d42e-4409-82a9-3990d7df3759","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 43(2), 872 - 904. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/ae03f43a-d42e-4409-82a9-3990d7df3759","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/ae03f43a-d42e-4409-82a9-3990d7df3759","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Feige, U, Krauthgamer, R, Makarychev, K, Nagarajan, V, Naor, J & Schwartz, R 2014, 'Min-max graph partitioning and small set expansion', SIAM Journal on Computing, vol. 43, no. 2, pp. 872-904. https://doi.org/10.1137/120873996","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1664046972","display_name":null,"funder_award_id":"639.022.211","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8240595191","display_name":null,"funder_award_id":"452/08","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G8446328826","display_name":null,"funder_award_id":"873/08","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G990861464","display_name":null,"funder_award_id":"954/11","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1977360022","https://openalex.org/W2018081021","https://openalex.org/W2019374631","https://openalex.org/W2022490362","https://openalex.org/W2053653244","https://openalex.org/W2107881198","https://openalex.org/W2114298221","https://openalex.org/W2150148016","https://openalex.org/W2163175782","https://openalex.org/W2167236203","https://openalex.org/W2176446742","https://openalex.org/W2397920857","https://openalex.org/W3009415557"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2065008672","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":{"We":[0,66,125,181],"study":[1],"graph":[2,13,158],"partitioning":[3],"problems":[4],"from":[5,121],"a":[6,35,60,68,142,157,166],"min-max":[7],"perspective,":[8],"in":[9,104,191],"which":[10],"an":[11,79,88,128,183,195],"input":[12],"on":[14],"$n$":[15],"vertices":[16],"should":[17],"be":[18,51],"partitioned":[19],"into":[20],"$k$":[21,47,63],"parts,":[22],"and":[23,55,75,99,110,160,194],"the":[24,29,46,93,116,147,161],"objective":[25],"is":[26,163],"to":[27,50,97,164],"minimize":[28],"maximum":[30],"number":[31],"of":[32,52,62,71,171,198],"edges":[33],"leaving":[34],"single":[36],"part.":[37],"The":[38],"two":[39,73],"main":[40],"versions":[41],"we":[42,154],"consider":[43,67],"are":[44,155],"where":[45,56],"parts":[48],"need":[49],"equal":[53],"size,":[54],"they":[57],"must":[58],"separate":[59],"set":[61,168],"given":[64,156],"terminals.":[65],"common":[69],"generalization":[70],"these":[72],"problems,":[74],"design":[76],"for":[77,92,115,132,145,188,200],"it":[78],"$O(\\sqrt{\\log":[80],"n\\log":[81],"k})$":[82],"approximation":[83,91,114,130,186],"algorithm.":[84],"This":[85],"improves":[86],"over":[87],"$O(\\log^2":[89],"n)$":[90,113],"second":[94],"version":[95,118],"due":[96],"Svitkina":[98],"Tardos":[100],"[Min-max":[101],"multiway":[102],"cut,":[103],"APPROX-RANDOM,":[105],"2004,":[106],"Springer,":[107],"Berlin,":[108],"2004],":[109],"roughly":[111],"$O(k\\log":[112],"first":[117],"that":[119,134,202],"follows":[120],"other":[122],"previous":[123],"work.":[124],"also":[126],"give":[127,182],"$O(1)$":[129,199],"algorithm":[131,140,187],"graphs":[133,201],"exclude":[135,203],"any":[136,204],"fixed":[137,205],"minor.":[138,206],"Our":[139],"uses":[141],"new":[143],"procedure":[144],"solving":[146],"small-set":[148,189],"expansion":[149,190],"problem.":[150],"In":[151],"this":[152],"problem,":[153],"$G$":[159],"goal":[162],"find":[165],"nonempty":[167],"$S\\subseteq":[169],"V$":[170],"size":[172],"$|S|":[173],"\\leq":[174],"\\rho":[175],"n$":[176],"with":[177],"minimum":[178],"edge":[179],"expansion.":[180],"$O(\\sqrt{\\log{n}\\log{(1/\\rho)}})$":[184],"bicriteria":[185],"general":[192],"graphs,":[193],"improved":[196],"factor":[197]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}