Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
暂无分享,去创建一个
[1] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[2] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[3] Daniel Bienstock,et al. Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations , 2006, SIAM J. Comput..
[4] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[5] Lisa Fleischer,et al. Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[6] Keith W. Ross,et al. Computer networking - a top-down approach featuring the internet , 2000 .
[7] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.
[8] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[9] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[10] A. Khanna,et al. The revised ARPANET routing metric , 1989, SIGCOMM 1989.
[11] Neal E. Young,et al. Sequential and parallel algorithms for mixed packing and covering , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[12] I. Richer,et al. A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..
[13] George Karakostas,et al. Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.
[14] Berthold Vöcking,et al. Fast convergence to Wardrop equilibria by adaptive sampling methods , 2006, STOC '06.
[15] Leonid Khachiyan,et al. Approximate minimum-cost multicommodity flows in , 1996 .
[16] Yossi Azar,et al. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[17] Naveen Garg,et al. On-line end-to-end congestion control , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[18] Yishay Mansour,et al. Fast convergence of selfish rerouting , 2005, SODA '05.
[19] Danny Raz,et al. Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[20] Leonid Khachiyan,et al. Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ−2KNM) timetime , 1996, Math. Program..
[21] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.