### Optimal hierarchical decompositions for congestion minimization in networks

暂无分享，去创建一个

[1] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.

[2] R. Ravi,et al. Approximation Algorithms for Requirement Cut on Graphs , 2005, APPROX-RANDOM.

[3] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 2006, Algorithmica.

[4] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[5] Satish Rao,et al. A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.

[6] 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.

[7] Yossi Azar,et al. Competitive multicast routing , 1995, Wirel. Networks.

[8] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..

[9] Neal E. Young,et al. Sequential and parallel algorithms for mixed packing and covering , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[10] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[11] James R. Lee,et al. Euclidean distortion and the sparsest cut , 2005, STOC '05.

[12] Noga Alon,et al. A general approach to online network optimization problems , 2004, SODA '04.

[13] Stefano Leonardi,et al. On-Line Routing in All-Optical Networks , 1997, ICALP.

[14] Edith Cohen,et al. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[15] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[16] Bruce M. Maggs,et al. Simultaneous source location , 2009, TALG.

[17] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[18] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC '93.

[19] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[20] 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).

[21] Mihalis Yannakakis,et al. Approximate max-flow min-(multi)cut theorems and their applications , 1993, STOC '93.

[22] Mohit Singh,et al. Approximating the k-multicut problem , 2006, SODA '06.

[23] Anupam Gupta,et al. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.

[24] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25] R. Khandekar. Lagrangian relaxation based algorithms for convex programming problems , 2004 .

[26] Sudipto Guha,et al. Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[27] Marcin Bienkowski,et al. A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.

[28] Robert Krauthgamer,et al. A Polylogarithmic Approximation of the Minimum Bisection , 2006, SIAM Rev..