{"id":"https://openalex.org/W2039303552","doi":"https://doi.org/10.1145/1806689.1806708","title":"Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms","display_name":"Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2039303552","doi":"https://doi.org/10.1145/1806689.1806708","mag":"2039303552"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806708","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806708","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":"conference-paper","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/A5032574693","display_name":"Aleksander M\u0105dry","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":"Aleksander Madry","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"raw_orcid":null,"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":1,"corresponding_author_ids":["https://openalex.org/A5032574693"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.1288,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.91999361,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"121","last_page":"130"},"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.9980999827384949,"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.9980999827384949,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9754999876022339,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9750000238418579,"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/fleischer","display_name":"Fleischer","score":0.7750363349914551},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.7377239465713501},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5352177619934082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5318861603736877},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.491986483335495},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4844939410686493},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48065197467803955},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4750364124774933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46484723687171936},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45244261622428894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39460140466690063},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.38435259461402893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29638051986694336}],"concepts":[{"id":"https://openalex.org/C2778707992","wikidata":"https://www.wikidata.org/wiki/Q1427812","display_name":"Fleischer","level":3,"score":0.7750363349914551},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.7377239465713501},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5352177619934082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5318861603736877},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.491986483335495},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4844939410686493},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48065197467803955},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4750364124774933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46484723687171936},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45244261622428894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39460140466690063},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.38435259461402893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29638051986694336},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C154775046","wikidata":"https://www.wikidata.org/wiki/Q188","display_name":"German","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"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.1145/1806689.1806708","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806708","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W330591652","https://openalex.org/W435007089","https://openalex.org/W1573558634","https://openalex.org/W1962291245","https://openalex.org/W1965176035","https://openalex.org/W1968023964","https://openalex.org/W1977545325","https://openalex.org/W1993161326","https://openalex.org/W1995150484","https://openalex.org/W2002272911","https://openalex.org/W2010223239","https://openalex.org/W2024236795","https://openalex.org/W2035652501","https://openalex.org/W2043129091","https://openalex.org/W2048382523","https://openalex.org/W2085849292","https://openalex.org/W2094515718","https://openalex.org/W2097458838","https://openalex.org/W2099463627","https://openalex.org/W2117595194","https://openalex.org/W2121902703","https://openalex.org/W2121993674","https://openalex.org/W2126166149","https://openalex.org/W2130674086","https://openalex.org/W2134422938","https://openalex.org/W2137582581","https://openalex.org/W2139666321","https://openalex.org/W2148411689","https://openalex.org/W2150439955","https://openalex.org/W2150865801","https://openalex.org/W2165956524","https://openalex.org/W2167732364","https://openalex.org/W2950851108","https://openalex.org/W4242767541"],"related_works":["https://openalex.org/W4231500168","https://openalex.org/W90079504","https://openalex.org/W2150439955","https://openalex.org/W4298389919","https://openalex.org/W2950851108","https://openalex.org/W2032436423","https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W2374451529","https://openalex.org/W1561045713"],"abstract_inverted_index":{"We":[0],"combine":[1],"the":[2,25,37,44,50,68],"work":[3],"of":[4,24,39,53],"Garg":[5],"and":[6,8,36,62],"Konemann,":[7],"Fleischer":[9],"with":[10],"ideas":[11],"from":[12],"dynamic":[13],"graph":[14],"algorithms":[15,55],"to":[16,59],"obtain":[17],"faster":[18],"(1-\u03b5)-approximation":[19],"schemes":[20],"for":[21,72],"various":[22],"versions":[23],"multicommodity":[26],"flow":[27],"problem.":[28],"In":[29],"particular,":[30],"if":[31],"\u03b5":[32],"is":[33,47],"moderately":[34],"small":[35],"size":[38],"every":[40],"number":[41],"used":[42],"in":[43],"input":[45],"instance":[46],"polynomially":[48],"bounded,":[49],"running":[51],"times":[52],"our":[54],"match":[56],"--":[57,67],"up":[58],"poly-logarithmic":[60],"factors":[61],"some":[63],"provably":[64],"optimal":[65],"terms":[66],"\u03a9(mn)":[69],"flow-decomposition":[70],"barrier":[71],"single-commodity":[73],"flow.":[74]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}