{"id":"https://openalex.org/W2008133042","doi":"https://doi.org/10.1137/s0097539703427215","title":"Quickest Flows Over Time","display_name":"Quickest Flows Over Time","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2008133042","doi":"https://doi.org/10.1137/s0097539703427215","mag":"2008133042"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703427215","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703427215","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/A5045233402","display_name":"Lisa Fleischer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lisa Fleischer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Skutella","raw_affiliation_strings":["Technical University of Dortmund,#TAB#"],"affiliations":[{"raw_affiliation_string":"Technical University of Dortmund,#TAB#","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045233402"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":27.106,"has_fulltext":false,"cited_by_count":186,"citation_normalized_percentile":{"value":0.99506505,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"36","issue":"6","first_page":"1600","last_page":"1630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.7739217877388},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6942368745803833},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6380264759063721},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5902398228645325},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5503992438316345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5472102761268616},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5401858687400818},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5001018047332764},{"id":"https://openalex.org/keywords/discrete-time-and-continuous-time","display_name":"Discrete time and continuous time","score":0.49038219451904297},{"id":"https://openalex.org/keywords/toolbox","display_name":"Toolbox","score":0.4600076973438263},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4540662169456482},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4122299551963806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40197044610977173},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3406085669994354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3259032070636749}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7739217877388},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6942368745803833},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6380264759063721},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5902398228645325},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5503992438316345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5472102761268616},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5401858687400818},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5001018047332764},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.49038219451904297},{"id":"https://openalex.org/C2777655017","wikidata":"https://www.wikidata.org/wiki/Q1501161","display_name":"Toolbox","level":2,"score":0.4600076973438263},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4540662169456482},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4122299551963806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40197044610977173},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3406085669994354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3259032070636749},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s0097539703427215","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703427215","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:CiteSeerX.psu:10.1.1.6.3689","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.3689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~skutella/FleischerSkutella.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.3118","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.3118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tu-berlin.de/~skutella/FleischerSkutella.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.6418","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/~lkf/papers/FS2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.6657","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.6657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://domino.watson.ibm.com/library/cyberdig.nsf/papers/49E00CD15329768985256D5D00516387/$File/RC22833.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1526340092","https://openalex.org/W1531908439","https://openalex.org/W1589042192","https://openalex.org/W1903284337","https://openalex.org/W1964119857","https://openalex.org/W1964443412","https://openalex.org/W1968268863","https://openalex.org/W1979552577","https://openalex.org/W1986538507","https://openalex.org/W2002958336","https://openalex.org/W2004700840","https://openalex.org/W2011039300","https://openalex.org/W2012470298","https://openalex.org/W2027029507","https://openalex.org/W2028316882","https://openalex.org/W2032247582","https://openalex.org/W2039657689","https://openalex.org/W2047907098","https://openalex.org/W2066074485","https://openalex.org/W2068218328","https://openalex.org/W2074117023","https://openalex.org/W2076171427","https://openalex.org/W2088045969","https://openalex.org/W2092572272","https://openalex.org/W2100440346","https://openalex.org/W2117595194","https://openalex.org/W2119098384","https://openalex.org/W2126469728","https://openalex.org/W2130626677","https://openalex.org/W2148204686","https://openalex.org/W2154745223","https://openalex.org/W2156849732","https://openalex.org/W2163534333","https://openalex.org/W2165956524","https://openalex.org/W2170193147","https://openalex.org/W2476096155","https://openalex.org/W2607875432","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W3161514703","https://openalex.org/W4206915070","https://openalex.org/W3000598246","https://openalex.org/W2531764854","https://openalex.org/W1994440468","https://openalex.org/W2368069542","https://openalex.org/W4311255633","https://openalex.org/W1970952976"],"abstract_inverted_index":{"Flows":[0],"over":[1,30,98,116],"time":[2,31,48,99,145],"(also":[3],"called":[4],"dynamic":[5,102],"flows)":[6],"generalize":[7],"standard":[8],"network":[9,44,155],"flows":[10,29,109,115],"by":[11,88],"introducing":[12],"an":[13,147],"element":[14],"of":[15,41,73,91,130,137,156,185],"time.":[16,117,131],"They":[17],"naturally":[18],"model":[19],"problems":[20],"where":[21],"travel":[22],"and":[23,65,93,173,192],"transmission":[24],"are":[25,32],"not":[26,197],"instantaneous.":[27],"Traditionally,":[28],"solved":[33],"in":[34,143],"time\u2010expanded":[35,75,122,154],"networks":[36,123],"that":[37,106,134,183],"contain":[38],"one":[39],"copy":[40],"the":[42,55,70,74,89,169],"original":[43],"for":[45,60,81,168],"each":[46],"discrete":[47],"step.":[49],"While":[50],"this":[51,84],"method":[52],"makes":[53],"available":[54],"whole":[56],"algorithmic":[57],"toolbox":[58],"developed":[59],"static":[61,107],"flows,":[62],"its":[63],"main":[64],"often":[66],"fatal":[67],"drawback":[68],"is":[69,190],"enormous":[71],"size":[72],"network.":[76],"We":[77,132],"present":[78],"several":[79],"approaches":[80],"coping":[82],"with":[83],"difficulty.":[85],"First,":[86],"inspired":[87],"work":[90],"Ford":[92],"Fulkerson":[94],"on":[95,126],"maximal":[96],"s\u2010t\u2010flows":[97],"(or":[100],"\u201cmaximal":[101],"s\u2010t\u2010flows\u201d),":[103],"we":[104,119,181],"show":[105,182],"length\u2010bounded":[108],"lead":[110],"to":[111,151],"provably":[112],"good":[113],"multicommodity":[114,174],"Second,":[118],"investigate":[120],"\u201ccondensed\u201d":[121],"which":[124],"rely":[125],"a":[127,135,152],"rougher":[128],"discretization":[129,149],"prove":[133],"solution":[136],"arbitrary":[138],"precision":[139],"can":[140],"be":[141],"computed":[142],"polynomial":[144,157],"through":[146],"appropriate":[148],"leading":[150],"condensed":[153],"size.":[158],"In":[159],"particular,":[160],"our":[161,193],"approach":[162],"yields":[163],"fully":[164],"polynomial\u2010time":[165],"approximation":[166,194],"schemes":[167,195],"NP\u2010hard":[170],"quickest":[171],"min\u2010cost":[172],"flow":[175,186],"problems.":[176],"For":[177],"single":[178],"commodity":[179],"problems,":[180],"storage":[184],"at":[187],"intermediate":[188],"nodes":[189],"unnecessary,":[191],"do":[196],"use":[198],"any.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}