{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:53:48Z","timestamp":1725576828977},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183171"},{"type":"electronic","value":"9783642183188"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18318-8_10","type":"book-chapter","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T03:58:06Z","timestamp":1295841486000},"page":"106-117","source":"Crossref","is-referenced-by-count":0,"title":["An FPTAS for Flows over Time with Aggregate Arc Capacities"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Dressler","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L. Fleischer","year":"2007","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM Journal on Computing\u00a036, 1600\u20131630 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1958)","journal-title":"Operations Research"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"Hoppe, B., Tardos, \u00c9.: The quickest transshipment problem. Mathematics of Operations Research\u00a025, 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(98)00009-1","volume":"22","author":"B. Klinz","year":"1998","unstructured":"Klinz, B., Woeginger, G.J.: One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. Operations Research Letters\u00a022, 119\u2013127 (1998)","journal-title":"Operations Research Letters"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/net.10112","volume":"43","author":"B. Klinz","year":"2004","unstructured":"Klinz, B., Woeginger, G.J.: Minimum-cost dynamic flows: The series-parallel case. Networks\u00a043, 153\u2013162 (2004)","journal-title":"Networks"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1137\/S1052623403432645","volume":"15","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., Skutella, M.: Flows over time with load-dependent transit times. SIAM Journal on Optimization\u00a015, 1185\u20131202 (2005)","journal-title":"SIAM Journal on Optimization"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ipl.2006.07.007","volume":"101","author":"V. Melkonian","year":"2007","unstructured":"Melkonian, V.: Flows in dynamic networks with aggregate arc capacities. Information Processing Letters\u00a0101, 30\u201335 (2007)","journal-title":"Information Processing Letters"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0166-218X(93)90050-X","volume":"42","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Serafini, P., Yannakakis, M.: Computing the throughput of a network with dedicated lines. Discrete Applied Mathematics\u00a042, 271\u2013278 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M. Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18318-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T20:25:57Z","timestamp":1553372757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18318-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183171","9783642183188"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18318-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}