|
Volume 4, Article 4 (pages 77-109)
Near-Optimal Network Design with Selfish Agents by Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, and Tom Wexler |
|
Volume 4, Article 1 (pages 1-20)
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks by Henning Bruhn, Jakub Černý, Alexander Hall, Petr Kolman, and Jiří Sgall |
|
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 by Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd |
|
Volume 2, Article 3 (pages 53-64)
An Improved Approximation Ratio for the Covering Steiner Problem by Anupam Gupta and Aravind Srinivasan |
|
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 |