Optimal File Sharing in Distributed Networks (1991)

by Moni Naor , Ron M. Roth
Venue:SIAM J. Comput
Citations:25 - 1 self

Active Bibliography

64 Approximating the Domatic Number – Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
31 An Extension of the Lovász Local Lemma, and its Applications to Integer Programming – Aravind Srinivasan - 1996
139 Approximation Algorithms for Disjoint Paths Problems – Jon Michael Kleinberg - 1996
30 New Algorithmic Aspects Of The Local Lemma With Applications To Routing And Partitioning – Tom Leighton, Chi-Jen Lu, SATISH RAO, ARAVIND SRINIVASAN
5 A Formal Description of the Transportation Problem – Thomas Dean, Thomas Dean, Lloyd Greenwald, Lloyd Greenwald - 1992
5 Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems – Petr Slavík - 1995
65 On Multi-dimensional Packing Problems – Chandra Chekuri , Sanjeev Khanna - 1999
4 Approximate Set Covering in Uniform Hypergraphs – Michael Krivelevich
7 ε-Approximations with Minimum Packing Constraint Violation (Extended Abstract) – Jyh-Han Lin, Jeffrey Scott Vitter
172 Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems – Sanjeev Arora, David Karger, Marek Karpinski - 1995
1 Near-Optimal List Colourings – Michael Molloy, Bruce Reed, Cnrs Ime-usp - 2000
28 Further Algorithmic Aspects of the Local Lemma – Michael Molloy, Bruce Reed - 2001
172 Efficient probabilistically checkable proofs and applications to approximation – M. Bellare, S. Goldwassert, C. Lundi, A. Russell - 1993
15 Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules – Tom Leighton - 1995
2 Diversity Coloring for Distributed Storage in Mobile Networks – Anxiao (andrew Jiang, Jehoshua Bruck - 2001
1 Srivastav; On constrained hypergraph coloring and scheduling. In: Approximation Algorithms for Combinatorial Optimization – Nitin Ahuja
17 Multicommodity flow and circuit switching – Tom Leighton, Satish Rao, Aravind Srinivasan - 1998
2 Weighted Fractional and Integral k-Matching in Hypergraphs – Anand Srivastav, Peter Stangier - 1995
44 On the Fault Tolerance of Some Popular Bounded-Degree Networks – Tom Leighton, Bruce Maggs, R. Sitaraman - 1992