Articles under category:
Networks
Networks
|
Vol 8, Article 18 (pp 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 |
|
Vol 8, Article 15 (pp 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 |
|
Vol 4, Article 4 (pp 77-109)
Near-Optimal Network Design with Selfish Agents by Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, and Tom Wexler |
|
Vol 4, Article 1 (pp 1-20)
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks by Henning Bruhn, Jakub Černý, Alexander Hall, Petr Kolman, and Jiří Sgall |
|
Vol 3, Article 1 (pp 1-23)
Censorship Resistant Peer-to-Peer Networks by Amos Fiat and Jared Saia |
|
Vol 2, Article 7 (pp 137-146)
An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow by Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd |
|
Vol 2, Article 3 (pp 53-64)
An Improved Approximation Ratio for the Covering Steiner Problem by Anupam Gupta and Aravind Srinivasan |
|
Vol 1, Article 6 (pp 105-117)
Combining Online Algorithms for Acceptance and Rejection by Yossi Azar, Avrim Blum, David P. Bunde, and Yishay Mansour |