Sat, 26 Jul 2008 07:57:58 BST CiteULike: p2pstreaming's flow http://www.citeulike.org/user/p2pstreaming/tag/flow CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/p2pstreaming/article/1325237 <i>(1999), pp. 981-982.</i> Faster approximation algorithms for generalized flow Kevin Wayne Lisa Fleischer (1999), pp. 981-982. 2007-05-24T14:44:56-00:00 1999 981 982 Society for Industrial and Applied Mathematics algorithm approximation flow generalized http://www.citeulike.org/user/p2pstreaming/article/606074 <i>(April 2006)</i> Approximation Algorithms for Survivable Multi-commodity Flow Problems with Applications to Network Design Todimala B Ramamurthy (April 2006) 2006-04-29T02:50:14-00:00 2006 approximation flow multicommodity survivable http://www.citeulike.org/user/p2pstreaming/article/530917 <i></i><br /><br />Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static flows, its main and often fatal drawback is the enormous size of the... Quickest Flows Over Time Lisa Fleischer Martin Skutella 2006-03-04T19:33:21-00:00 flow quickest http://www.citeulike.org/user/p2pstreaming/article/334045 <i>Journal of ACM, Vol. 37 (1990)</i> The Maximum Concurrent Flow Problem F Shahrokhi DW Matula Journal of ACM, Vol. 37 (1990) 2005-09-28T16:27:57-00:00 1990 Journal of ACM 37 algorithm flow multicommodity http://www.citeulike.org/user/p2pstreaming/article/333937 <i>SIAM Journal of Discrete Mathematics, Vol. 13 (2000)</i> Approximating Fractional Multicommodity Flow Independent of the Number of Commodities LK Fleischer SIAM Journal of Discrete Mathematics, Vol. 13 (2000) 2005-09-28T16:27:37-00:00 2000 SIAM Journal of Discrete Mathematics 13 algorithm flow linear multicommodity programming