Articles under category:
Networks
 Volume 8, Article 18 (pages 401-413) [Motwani Special Issue] An $O(k^3\log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design by Julia Chuzhoy and Sanjeev Khanna
 Volume 8, Article 15 (pages 351-368) [Motwani Special Issue] One Tree Suffices: A Simultaneous $O(1)$-Approximation for Single-Sink Buy-at-Bulk by Ashish Goel and Ian Post
 Volume 4, Article 4 (pages 77-109) Near-Optimal Network Design with Selfish Agents
 Volume 4, Article 1 (pages 1-20) Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
 Volume 3, Article 1 (pages 1-23) Censorship Resistant Peer-to-Peer Networks by Amos Fiat and Jared Saia
 Volume 2, Article 7 (pages 137-146) An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow
 Volume 2, Article 3 (pages 53-64) An Improved Approximation Ratio for the Covering Steiner Problem
 Volume 1, Article 6 (pages 105-117) Combining Online Algorithms for Acceptance and Rejection by Yossi Azar, Avrim Blum, David P. Bunde, and Yishay Mansour