Near-Linear Time Construction of Sparse Neighborhood Covers

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 263-277

  Awerbuch, Baruch ^a,b   Berger, Bonnie ^a   Cowen, Lenore ^c   Peleg, David ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c Johns Hopkins University   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximate shortest paths; Neighborhood covers; Network decompositions; Spanners

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

APPROXIMATE SHORTEST PATHS; GRAPH SPANNERS; NEIGHBORHOOD COVERS; NETWORK DECOMPOSITIONS;

GRAPH THEORY;

EID: 0032057919     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794271898     Document Type: Article

References (27)

1. Y. AFEK AND M. RICKLIN, Sparser: A paradigm for running distributed algorithms, in Proc. 6th Workshop on Distributed Algorithms, Springer-Verlag, New York, 1992, pp. 1-10.
2. R. K. AHUJA, K. MELHOURN, J. B. ORLIN, AND R. E. TARJAN, Faster Algorithms for the Shortest Path Problem, Technical Report 193, MIT Operations Research Center, Cambridge, MA, 1988.
3. N. ALON, Z. GALIL, AND O. MARGALIT, On the exponent of the all-pairs shortest path problem, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1991.
4. N. ALON, Z. GALIL, O. MARGALIT, AND M. NAOR, Witnesses for boolean matrix multiplication and for shortest paths, In Proc. 33rd IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1992.
5. B. AWERBUCH, A. BARATZ, AND D. PELEG, Efficient Broadcast and Light-Weight Spanners, Unpublished manuscript, 1991.
6. B. AWERBUCH, B. PATT-SHAMIR, D. PELEG, AND M. SAKS, Adapting to asynchronous dynamic networks with polylogarithmic overhead, in Proc. 24th ACM Symp. on Theory of Computing, ACM, New York, 1992, pp. 557-570.
7. B. AWERBUCH AND D. PELEG, Efficient Distributed Construction of Sparse Covers, Technical Report CS90-17, The Weizmann Institute, Rehovot, Israel, 1990.
8. B. AWERBUCH AND D. PELEG, Network synchronization with poly logarithmic overhead, in 31st IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1990, pp. 514-522.
9. B. AWERBUCH AND D. PELEG, Sparse partitions, in 31st IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1990, pp. 503-513.
10. 2 log n log* n), Technical Report 80-3, Dept. of Computer Science, State University of Albany, New York, 1980.
11. B. CHANDRA, G. DAS, G. NARASIMHAN, AND J. SOARES, New sparseness results on graph spanners, in Proc. 8th ACM Symp. on Computational Geometry, ACM, New York, 1992.
12. E. COHEN, Fast algorithms for constructing t-spanners and paths with stretch t, in Proc. 34th IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1993, pp. 648-658.
13. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press/McGraw-Hill, New York, 1990.
14. M. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach., 34 (1987), pp. 596-615.
15. A. M. FRIEZE AND G. R. GRIMMET, The shortest-path problem for graphs with random arc-lengths, Disc. Appl. Math., 10 (1985), pp. 57-77.
16. H. GABOW, Scaling algorithms for network problems, J. Comput. System Sci., 31 (1985), pp. 148-168.
17. H. JAKOBSSON, Mixed-approach algorithms for transitive closure, in Proc. 10th ACM Symp. on Principles of Database Systems, ACM, New York, 1991.
18. D. JOHNSON, Efficient algorithms for shortest paths in sparse networks, J. Assoc. Comput. Mach., 24 (1977), pp. 1-13.
19. D. R. KARGER, D. KOLLER, AND S. J. PHILLIPS, Finding the hidden path: Time bounds for all-pairs shortest paths, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1991.
20. P. N. KLEIN, A Parallel Randomized Approximation Scheme for Shortest Paths, Technical Report CS-91-56, Brown University, Providence, RI, 1991.
21. N. LINIAL AND M. SAKS, Decomposing graphs into regions of small diameter, in Proc- 2nd ACM-SIAM Symp. on Discrete Algorithms, SIAM, Philadelphia, 1991, pp. 320-330.
22. C. C. McGEOCH, A New All-Pairs Shortest-Path Algorithm, Technical Report 91-30, DIMACS, New Brunswick, NJ, 1991.
23. D. PELEG, Sparse Graph Partitions, Technical Report CS89-01, The Weizmann Institute, Rehovot, Israel, 1989.
24. S. RAO, Finding small edge cuts in planar graphs, in Proc. 24th ACM Symp. on Theory of Computing, ACM, New York, 1992, pp. 229-240.
25. R. SEIDEL, On the all-pairs-shortest-path problem, in Proc. 24th ACM Symp. on Theory of Computing, ACM, New York, 1992, pp. 745-749.
26. 2 n), SIAM J. Comput., 2 (1973), pp. 28-32.
27. J. D. ULLMAN AND M. YANNAKAKIS, High-probability parallel transitive closure algorithms, SIAM J. Comput., 20 (1991), pp. 100-125.