{"id":"https://openalex.org/W2076164610","doi":"https://doi.org/10.1137/05064299x","title":"Improved Approximation Algorithms for Minimum Weight Vertex Separators","display_name":"Improved Approximation Algorithms for Minimum Weight Vertex Separators","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2076164610","doi":"https://doi.org/10.1137/05064299x","mag":"2076164610"},"language":"en","primary_location":{"id":"doi:10.1137/05064299x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/05064299x","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013190102","display_name":"Uriel Feige","orcid":"https://orcid.org/0009-0006-3749-4392"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uriel Feige","raw_affiliation_strings":["urifeige@microsoft.com and uriel.feige@weizmann.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"urifeige@microsoft.com and uriel.feige@weizmann.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["hajiagha@theory.csail.mit.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"hajiagha@theory.csail.mit.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028879014","display_name":"James R. Lee","orcid":"https://orcid.org/0000-0002-3512-1617"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James R. Lee","raw_affiliation_strings":["jrl@cs.washington.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"jrl@cs.washington.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":18.5647,"has_fulltext":false,"cited_by_count":282,"citation_normalized_percentile":{"value":0.99531955,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"38","issue":"2","first_page":"629","last_page":"657"},"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.9994999766349792,"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.9994999766349792,"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.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8113394975662231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7180695533752441},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6961828470230103},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6058632731437683},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5817319750785828},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4903149902820587},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47370001673698425},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.43407493829727173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4290223717689514},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4238506257534027},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4197661876678467},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.36129632592201233},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28802725672721863},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.26839107275009155},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13239553570747375}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8113394975662231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7180695533752441},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6961828470230103},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6058632731437683},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5817319750785828},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4903149902820587},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47370001673698425},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.43407493829727173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4290223717689514},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4238506257534027},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4197661876678467},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.36129632592201233},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28802725672721863},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.26839107275009155},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13239553570747375},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/05064299x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/05064299x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1982180670","https://openalex.org/W1985733932","https://openalex.org/W2007806267","https://openalex.org/W2011601876","https://openalex.org/W2013522700","https://openalex.org/W2019137761","https://openalex.org/W2027562075","https://openalex.org/W2029282358","https://openalex.org/W2029448190","https://openalex.org/W2029854525","https://openalex.org/W2063491776","https://openalex.org/W2070745908","https://openalex.org/W2073558110","https://openalex.org/W2075022748","https://openalex.org/W2081052144","https://openalex.org/W2087083200","https://openalex.org/W2091602684","https://openalex.org/W2107881198","https://openalex.org/W2150148016","https://openalex.org/W2154876245","https://openalex.org/W2176446742","https://openalex.org/W3022762247","https://openalex.org/W3098011928"],"related_works":["https://openalex.org/W4301463689","https://openalex.org/W2605313623","https://openalex.org/W2952055179","https://openalex.org/W2289764920","https://openalex.org/W3040665423","https://openalex.org/W4302786124","https://openalex.org/W3007661461","https://openalex.org/W3089416906","https://openalex.org/W3174801863","https://openalex.org/W2550548770"],"abstract_inverted_index":{"We":[0,50,88,161],"develop":[1],"the":[2,12,20,37,71,78,147,188,196,260],"algorithmic":[3],"theory":[4],"of":[5,14,70,77,113,159,182,190,200,214,225],"vertex":[6,59,129,170],"separators":[7,171],"and":[8,73,120,142],"its":[9],"relation":[10],"to":[11,84,118,220,268],"embeddings":[13,26],"certain":[15],"metric":[16],"spaces.":[17],"Unlike":[18],"in":[19,61,131,172,211,263,276],"edge":[21],"case,":[22],"we":[23,115,177,204,217,254],"show":[24,218],"that":[25,36],"into":[27],"$L_1$":[28],"(and":[29],"even":[30],"Euclidean":[31],"embeddings)":[32],"are":[33],"insufficient":[34],"but":[35],"additional":[38],"structure":[39],"provided":[40],"by":[41],"many":[42],"embedding":[43],"theorems":[44],"does":[45],"suffice":[46],"for":[47,56,97,126,139,143,167,209,259,273],"our":[48],"purposes.":[49],"obtain":[51,205,269],"an":[52,91,163,179,191],"$O(\\sqrt{\\log":[53,164,183],"n})$":[54,165],"approximation":[55,125,180,207,258,271],"minimum":[57,127],"ratio":[58,128,150,181],"cuts":[60,130],"general":[62,144,173],"graphs,":[63,114,141],"based":[64],"on":[65,103,109],"a":[66,74,123,157,222,242,246,256],"new":[67],"semidefinite":[68],"relaxation":[69],"problem,":[72],"tight":[75],"analysis":[76],"integrality":[79],"gap":[80],"which":[81],"is":[82,187],"shown":[83],"be":[85,266],"$\\Theta(\\sqrt{\\log":[86],"n})$.":[87],"also":[89],"prove":[90],"optimal":[92,192],"$O(\\log":[93,152,201],"k)$-approximate":[94],"max-flow/min-vertex-cut":[95],"theorem":[96],"arbitrary":[98],"vertex-capacitated":[99],"multicommodity":[100],"flow":[101],"instances":[102,108],"k":[104],"terminals.":[105],"For":[106,239],"uniform":[107],"any":[110,212],"excluded-minor":[111,145],"family":[112],"improve":[116],"this":[117,121,135],"$O(1)$,":[119],"yields":[122],"constant-factor":[124,257],"such":[132,277],"graphs.":[133,174,278],"Previously,":[134],"was":[136,151],"known":[137,149],"only":[138],"planar":[140],"families":[146],"best":[148,198],"n)$.":[153],"These":[154],"results":[155],"have":[156],"number":[158],"applications.":[160],"exhibit":[162],"pseudoapproximation":[166],"finding":[168],"balanced":[169],"In":[175],"fact,":[176],"achieve":[178],"{opt}})$,":[184],"where":[185],"${opt}$":[186],"size":[189],"separator,":[193],"improving":[194],"over":[195],"previous":[197,233],"bound":[199],"{opt})$.":[202],"Likewise,":[203],"improved":[206],"ratios":[208],"treewidth:":[210],"graph":[213,244],"treewidth":[215],"k,":[216],"how":[219],"find":[221],"tree":[223],"decomposition":[224],"width":[226],"at":[227],"most":[228],"$O(k":[229,236],"\\sqrt{\\log":[230],"k})$,":[231],"whereas":[232],"algorithms":[234],"yielded":[235],"\\log":[237],"k)$.":[238],"graphs":[240],"excluding":[241],"fixed":[243],"as":[245],"minor":[247],"(which":[248],"includes,":[249],"e.g.,":[250],"bounded":[251],"genus":[252],"graphs),":[253],"give":[255],"treewidth.":[261],"This":[262],"turn":[264],"can":[265],"used":[267],"polynomial-time":[270],"schemes":[272],"several":[274],"problems":[275]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":51},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":15}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}