{"id":"https://openalex.org/W2725976336","doi":"https://doi.org/10.1137/130908440","title":"Vertex Sparsifiers: New Results from Old Techniques","display_name":"Vertex Sparsifiers: New Results from Old Techniques","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2725976336","doi":"https://doi.org/10.1137/130908440","mag":"2725976336"},"language":"en","primary_location":{"id":"doi:10.1137/130908440","is_oa":true,"landing_page_url":"https://doi.org/10.1137/130908440","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1137/130908440","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Matthias Englert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Englert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Anupam Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Robert Krauthgamer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Harald R\u00e4cke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harald R\u00e4cke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Inbal Talgam-Cohen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Inbal Talgam-Cohen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Kunal Talwar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kunal Talwar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":{"value":2210,"currency":"EUR","value_usd":2383},"fwci":1.057,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.79930362,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"43","issue":"4","first_page":"1239","last_page":"1262"},"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.9229000210762024,"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.9229000210762024,"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.06620000302791595,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/regular-polygon","display_name":"Regular polygon","score":0.6032999753952026},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5929999947547913},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5069000124931335},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4894999861717224},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44909998774528503},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.40639999508857727},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.400299996137619},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3763999938964844},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.37209999561309814}],"concepts":[{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6032999753952026},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5929999947547913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5613999962806702},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5069000124931335},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4894999861717224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47429999709129333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44909998774528503},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.40639999508857727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4009000062942505},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.400299996137619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3806000053882599},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3763999938964844},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.37209999561309814},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3686000108718872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34700000286102295},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.33869999647140503},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.314300000667572},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2912999987602234},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26019999384880066},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2513999938964844}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/130908440","is_oa":true,"landing_page_url":"https://doi.org/10.1137/130908440","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1006.4586","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1006.4586","pdf_url":"https://arxiv.org/pdf/1006.4586","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1137/130908440","is_oa":true,"landing_page_url":"https://doi.org/10.1137/130908440","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8115207947","display_name":null,"funder_award_id":"EP/F043333/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1992849490","https://openalex.org/W2043520568","https://openalex.org/W2088844265","https://openalex.org/W2106663623","https://openalex.org/W3030774092"],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,8,19,49,54,66,76,134,143,155,169,176,180,191,199],"capacitated":[2],"graph":[3,20,50,178],"$G":[4],"=":[5,152],"(V,E)$":[6],"and":[7,45,107,109,240],"set":[9],"of":[10,79,85,88,95,112,119,145,158,171,183,213,227],"terminals":[11,25,34,162],"$K":[12],"\\subseteq":[13],"V$,":[14],"how":[15],"should":[16],"we":[17,61,71,127],"produce":[18],"$H$":[21,41,51,63,73,137],"only":[22],"on":[23,83,93,117],"the":[24,33,89,113,161,203,206,211],"$K$":[26,163],"so":[27],"that":[28,138,164,186],"every":[29],"(multicommodity)":[30],"flow":[31,55,135],"between":[32],"in":[35,40,209,218],"$G$":[36],"could":[37],"be":[38,65,75],"supported":[39],"with":[42],"low":[43],"congestion,":[44],"vice":[46],"versa?":[47],"(Such":[48],"is":[52],"called":[53],"sparsifier":[56,136],"for":[57,131,175,202,236],"$G$.)":[58],"What":[59,69],"if":[60,70],"want":[62],"to":[64,74,142,168,190,197,224],"\u201csimple\u201d":[67],"graph?":[68],"allow":[72],"convex":[77,156,181],"combination":[78,157,182],"simple":[80],"graphs?":[81],"Improving":[82],"results":[84],"Moitra":[86,110],"[Proceedings":[87,111],"50th":[90],"IEEE":[91,98],"Symposium":[92,116],"Foundations":[94],"Computer":[96,99],"Science,":[97],"Society,":[100],"Los":[101],"Alamitos,":[102],"CA,":[103],"2009,":[104],"pp.":[105,125],"3--12]":[106],"Leighton":[108],"42nd":[114],"ACM":[115],"Theory":[118],"Computing,":[120],"ACM,":[121],"New":[122],"York,":[123],"2010,":[124],"47--56],":[126],"give":[128,198],"efficient":[129],"algorithms":[130],"constructing":[132],"(a)":[133],"maintains":[139,165,187],"congestion":[140,166,188],"up":[141,167,189],"factor":[144,170],"$O(\\frac{\\log":[146],"k}{\\log":[147],"\\log":[148],"k})$,":[149],"where":[150],"$k":[151],"|K|$;":[153],"(b)":[154],"trees":[159],"over":[160],"$O(\\log":[172],"k)$;":[173],"(c)":[174],"planar":[177,184],"$G$,":[179],"graphs":[185],"constant":[192],"factor.":[193],"This":[194],"requires":[195],"us":[196],"new":[200],"algorithm":[201],"0-extension":[204],"problem,":[205],"first":[207],"one":[208],"which":[210],"preimages":[212],"each":[214],"terminal":[215],"are":[216],"connected":[217],"$G$.":[219],"Moreover,":[220],"this":[221],"result":[222],"extends":[223],"minor-closed":[225],"families":[226],"graphs.":[228],"Our":[229],"bounds":[230],"immediately":[231],"imply":[232],"improved":[233],"approximation":[234],"guarantees":[235],"several":[237],"terminal-based":[238],"cut":[239],"ordering":[241],"problems.":[242]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2017-07-14T00:00:00"}