{"id":"https://openalex.org/W2012776084","doi":"https://doi.org/10.1145/1806689.1806698","title":"Extensions and limits to vertex sparsification","display_name":"Extensions and limits to vertex sparsification","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2012776084","doi":"https://doi.org/10.1145/1806689.1806698","mag":"2012776084"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806698","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/80835","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110453378","display_name":"Frank Thomson Leighton","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. Thomson Leighton","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045798295","display_name":"Ankur Moitra","orcid":"https://orcid.org/0000-0001-7047-0495"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankur Moitra","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110453378"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":5.1254,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.95476235,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"56"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9787999987602234,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.968500018119812,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/vertex","display_name":"Vertex (graph theory)","score":0.6241402626037598},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5855671167373657},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5773152709007263},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5733147263526917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5429877638816833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5409558415412903},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4201020896434784},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.41732969880104065},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12724757194519043},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09808212518692017}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6241402626037598},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5855671167373657},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5773152709007263},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5733147263526917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5429877638816833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5409558415412903},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4201020896434784},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.41732969880104065},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12724757194519043},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09808212518692017}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1806689.1806698","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.168.5790","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.5790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/moitra/docs/mcfspar.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/80835","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/80835","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/80835","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/80835","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1568228897","https://openalex.org/W1976125024","https://openalex.org/W1976329386","https://openalex.org/W1984361668","https://openalex.org/W1992849490","https://openalex.org/W2038142281","https://openalex.org/W2042899161","https://openalex.org/W2044343300","https://openalex.org/W2045107949","https://openalex.org/W2048843200","https://openalex.org/W2051540665","https://openalex.org/W2052844078","https://openalex.org/W2055636480","https://openalex.org/W2105831729","https://openalex.org/W2121615984","https://openalex.org/W2125664420","https://openalex.org/W2137690813","https://openalex.org/W2150187954","https://openalex.org/W2159586130","https://openalex.org/W2160770200","https://openalex.org/W2419092805","https://openalex.org/W2564802890"],"related_works":["https://openalex.org/W2267059662","https://openalex.org/W4388411807","https://openalex.org/W2364268683","https://openalex.org/W2478803962","https://openalex.org/W3169430512","https://openalex.org/W2144570076","https://openalex.org/W2384804534","https://openalex.org/W2154069781","https://openalex.org/W2304968498","https://openalex.org/W4239816659"],"abstract_inverted_index":{"Suppose":[0],"we":[1,148],"are":[2],"given":[3],"a":[4,11,24,48,51,95,106,137],"graph":[5,25,49,107],"G":[6,88],"=":[7,27,80,109],"(V,":[8],"E)":[9],"and":[10],"set":[12],"of":[13,22,35,66,97,104,120,126],"terminals":[14],"K":[15],"\u2282":[16],"V.":[17],"We":[18,44,54],"consider":[19,101],"the":[20,33,64,102,118,127],"problem":[21,103],"constructing":[23],"H":[26,108],"(K,":[28,110],"EH)":[29,111],"that":[30,56,61,115],"approximately":[31,116],"preserves":[32,117],"congestion":[34,65],"every":[36],"multicommodity":[37,68],"flow":[38,52,59,145],"with":[39],"endpoints":[40],"supported":[41],"in":[42,158],"K.":[43],"refer":[45],"to":[46,85,135],"such":[47],"as":[50],"sparsifier.":[53],"prove":[55],"there":[57],"exist":[58],"sparsifiers":[60,143],"simultaneously":[62],"preserve":[63],"all":[67,151],"flows":[69],"within":[70],"an":[71],"O(log":[72],"k":[73],"/":[74],"log":[75,76],"k)-factor":[77],"where":[78],"|K|":[79],"k.":[81],"This":[82,93],"bound":[83],"improves":[84],"O(1)":[86],"if":[87],"excludes":[89],"any":[90,124],"fixed":[91],"minor.":[92],"is":[94],"strengthening":[96],"previous":[98],"results,":[99],"which":[100],"finding":[105],"(a":[112],"cut":[113,142],"sparsifier)":[114],"value":[119],"minimum":[121],"cuts":[122],"separating":[123],"partition":[125],"terminals.":[128],"Indirectly":[129],"our":[130],"result":[131],"also":[132],"allows":[133],"us":[134],"give":[136],"construction":[138],"for":[139],"better":[140],"quality":[141],"(and":[144],"sparsifiers).":[146],"Thereby,":[147],"immediately":[149],"improve":[150],"approximation":[152],"ratios":[153],"derived":[154],"using":[155],"vertex":[156],"sparsification":[157],"[14].":[159]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}