Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

Improved Approximation Algorithms the Multi-Commodity Flow Problem and Competitive Routing in Dynamic Networks

[1]  A. V. Karzanov,et al.  Determining the maximal flow in a network by the method of preflows , 1974 .

[2]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[3]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[4]  Yehuda Afek,et al.  End-to-end communication in unreliable networks , 1988, PODC '88.

[5]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[6]  Nir Shavit,et al.  Polynomial end-to-end communication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[9]  R. Ravi,et al.  Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10]  Fillia Makedon,et al.  Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.

[11]  Yehuda Afek,et al.  Bootstrap network resynchronization (extended abstract) , 1991, PODC '91.

[12]  Yehuda Afek,et al.  The slide mechanism with applications in dynamic networks , 1992, PODC '92.

[13]  Baruch Awerbuch,et al.  A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[14]  Bruce M. Maggs,et al.  Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.

[15]  Serge A. Plotkin,et al.  Fast approximation algorithm for minimum cost multicommodity flow , 1995, SODA '95.

[16]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .