A variant of the arrow distributed directory with low average complexity (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 615-624

  Peleg, David ^a   Reshef, Eilon ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY;

AVERAGE COMPLEXITY; AVERAGE-CASE BEHAVIOR; COMMUNICATION COST; DIRECTORY PROTOCOL; DISTRIBUTED SYSTEMS; EXTENDED ABSTRACTS; MINIMUM SPANNING TREES; PROBABILISTIC APPROXIMATION;

PROBABILITY DISTRIBUTIONS;

EID: 84887502074     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_58     Document Type: Conference Paper

References (16)

1. N. Alon, R.M. Karp, D. Peleg, and D. West. A graph-theoretic game and its appli- cation to the k-server problem. SIAM J. on Computing, pages 78{100, 1995.
2. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th IEEE Symp. on Foundations of Computer Science, pages 184{193, 1996.
3. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proc. 30th Annual ACM Symp. on Theory of Computer Science, 1998.
4. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, A. Wigderson. On the Power of Randomization in Online Algorithms In Proc. 22nd Annual ACM Symp. on Theory of Computer Science, pages 379{386, May 1990.
5. L. Cai, D.G. Corneil. Tree Spanners. SIAM J. Disc. Math., 8:359{387, 1995.
6. M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median. In Proc. 39th Annual ACM Symp. on Theory of Computer Science, 1998.
7. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a Finite Metric by a Small Number of Tree Metrics. In Proc. 39th IEEE Symp. on Foundations of Computer Science, November 1998.
8. Michael J. Demmer, Maurice P. Herlihy. The Arrow Distributed Directory Protocol. In Proc. 17th ACM Symp. on Principles of Distributed Computing, August 1998.
9. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, CA, 1979.
10. T.C. Hu. Optimum communication spanning trees. SIAM J. on Computing, pages 188{195, 1974.
11. D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy-Kan. The complexity of the network design problem. Networks, 8:275{285, 1978.
12. A. Kershenbaum. Telecommunications network design algorithms. McGraw-Hill Book Co., 1993.
13. M.S. Manasse, L.A. McGeoch, D.D. Sleator. Competitive Algorithms for On-Line Problems. In Proc. 20th Annual ACM Symp. on Theory of Computer Science, pages 322{330, May 1988.
14. D. Peleg, E. Reshef. Deterministic Polylog Approximation for Minimum Communication Spanning Trees. In Proc. 25th International Colloquium on Automata, Languages, and Programming, pages 670{681, July 1998.
15. B.Y. Wu, G. Lancia, Y. Bafna, K.M. Chao, R. Ravi, and C.Y. Tang. A polynomial time approximation scheme for minimum routing cost spanning trees. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 21{32, January 1998.
16. R. Wong Worst case Analysis of Network Design Problem Heuristics. In SIAM J. Algebraic Discr. Meth., 1:51{63, 1980.