Geometry and Expansion: A survey of some results Sanjeev Arora Princeton ( touches upon: S. A., Satish Rao, Umesh Vazirani, STOC04; S. A., Elad Hazan,
Buy at Bulk Network Design (with Protection) Chandra Chekuri Univ. of Illinois, Urbana-Champaign.
Vertex sparsifiers: New results from old techniques (and some open questions) Robert Krauthgamer (Weizmann Institute) Joint work with Matthias Englert,
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design Problems Mohammad R. Salavatipour Department of Computing Science University of Alberta.
Expander flows, geometric embeddings, and graph partitioning Sanjeev Arora Princeton Satish Rao UC Berkeley Umesh Vazirani UC Berkeley ( + survey of other.
Geometric Embeddings, Graph Partitioning, and Expander flows: A survey of recent results Sanjeev Arora Princeton ( touches upon: S. A., Satish Rao, Umesh.
Building Edge-Failure Resilient Networks Chandra Chekuri Bell Labs Anupam Gupta Bell Labs ! CMU Amit Kumar Cornell ! Bell Labs Seffi Naor, Danny Raz Technion.
Geometry and Expansion: A survey of some results
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design Problems
Buy at Bulk Network Design (with Protection)
Cooperative Weakest Link Games
