Transitive-closure spanners

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 932-941

  Bhattacharyya, Arnab ^a   Grigorescu, Elena ^a   Jung, Kyomin ^a   Raskhodnikova, Sofya ^b   Woodruff, David P ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; APPROXIMATION ALGORITHMS; CONVEX OPTIMIZATION; TREES (MATHEMATICS);

APPROXIMATION RATIOS; COMPLEXITY THEORY; DETERMINISTIC ALGORITHMS; DIVERSE APPLICATIONS; INAPPROXIMABILITY; TECHNICAL CONTRIBUTION; TRANSITIVE CLOSURE; TRANSITIVE REDUCTIONS;

DIRECTED GRAPHS;

EID: 70349157218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.101     Document Type: Conference Paper

References (50)

1. I. Abraham and C. Gavoille. Object location using path separators. In PODC, pages 188-197, 2006.
2. W. Ackermann. Zum Hilbertshen aufbau der reelen zahlen. Math. Ann., 99:118-133, 1928.
3. A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. SIAM J. Comput., 1(2):131-137, 1972.
4. N. Ailon and B. Chazelle. Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput., 204(11):1704-1717, 2006.
5. N. Alon and B. Schieber. Optimal preprocessing for answering on-line product queries. Technical Report 71 /87, Tel-Aviv University, 1987.
6. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993.
7. M. J. Atallah, M. Blanton, and K. B. Frikken. Key management for non-tree access hierarchies. In SACMAT, pages 11-18, 2006.
8. M. J. Atallah, K. B. Frikken, and M. Blanton. Dynamic and efficient key management for access hierarchies. In ACM Conference on Computer and Communications Security, pages 190-202, 2005. (Pubitemid 44022003)
9. 2) time. ACM Transactions on Algorithms, 2(4):557-577, 2006. (Pubitemid 46174061)
10. A. Bhattacharyya, E. Grigorescu, K. Jung, S. Raskhodnikova, and D. P. Woodruff. Transitive-closure spanners. http://arxiv.org/abs/0808.1787, 2008.
11. B. Chazelle. Computing on a free tree via complexity-preserving mappings. Algorithmica, 2:337-361, 1987.
12. C. Chekuri, G. Even, A. Gupta, and D. Segev. Set connectivity problems in undirected graphs and the directed steiner network problem. In SODA, 2008.
13. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput., 28(1):210-236, 1998.
14. E. Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest paths. JACM, 47(1):132-166, 2000.
15. L. Cowen. Compact routing with minimum stretch. J. Algorithms, 38(1):170-183, 2001.
16. L. Cowen and C. G. Wagner. Compact roundtrip routing in directed networks. J. Algorithms, 50(1):79-95, 2004.
17. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky. Improved testing algorithms for monotonicity. In RANDOM, pages 97-108, 1999.
18. Y. Dodis and S. Khanna. Designing networks with bounded pairwise distance. In STOC, pages 750-759, 1999.
19. M. Elkin. Computing almost shortest paths. In PODC, pages 53-62, 2001.
20. M. Elkin and D. Peleg. Strong inapproximability of the basic k-spanner problem. In ICALP, pages 636-647, 2000.
21. M. Elkin and D. Peleg. The client-server 2-spanner problem with applications to network design. In SIROCCO, pages 117-132, 2001.
22. M. Elkin and D. Peleg. Approximating k-spanner problems for k ≥ 2. Theor. Comput. Sci., 337(1-3):249-277, 2005.
23. M. Elkin and D. Peleg. The hardness of approximating spanner problems. Theory Comput. Syst., 41(4):691-729, 2007.
24. F. Ergun, S. Kannan, S. R. Kumar, R. Rubinfeld, and M. Viswanathan. Spot-checkers. JCSS, 60(3):717-751, 2000.
25. E. Fischer. On the strength of comparisons in property testing. Inf. Comput., 189(1):107-116, 2004.
26. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, and A. Samorodnitsky. Monotonicity testing over general poset domains. In STOC, pages 474-483, 2002.
27. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky. Testing monotonicity. Combinatorica, 20(3):301-337, 2000.
28. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653-750, 1998. (Pubitemid 128488791)
29. S. Halevy and E. Kushilevitz. Testing monotonicity over graph products. In ICALP, pages 721-732, 2004.
30. W. Hesse. Directed graphs requiring large numbers of shortcuts. In SODA, pages 665-669, 2003.
31. D. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston, 1997.
32. G. Kortsarz. On the hardness of approximating spanners. Algorithmica, 30(3):432-450, 2001.
33. G. Kortsarz and D. Peleg. Generating sparse 2-spanners. J. Algorithms, 17:222-236, 1994.
34. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177-189, 1979.
35. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
36. D. Peleg and A. A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99-116, 1989.
37. D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. SIAM J. Comput., 18(4):740-747, 1989.
38. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. JACM, 36(3):510-530, 1989.
39. L. Roditty, M. Thorup, and U. Zwick. Roundtrip spanners and roundtrip routing in directed graphs. In SODA, pages 844-851, 2002.
40. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. (Pubitemid 126577271)
41. A. D. Santis, A. L. Ferrara, and B. Masucci. Efficient provably-secure hierarchical key assignment schemes. In MFCS, pages 371-382, 2007.
42. M. Thorup. On shortcutting digraphs. In WG, pages 205-211, 1992.
43. M. Thorup. Shortcutting planar digraphs. Combinatorics, Probability & Computing, 4:287-315, 1995.
44. M. Thorup. Parallel shortcutting of rooted trees. J. Algorithms, 23(1):139-159, 1997.
45. M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. JACM, 51:993-1024, 2004. (Pubitemid 40818313)
46. M. Thorup and U. Zwick. Compact routing schemes. In ACM Symposium on Parallel Algorithms and Architectures, pages 1-10, 2001.
47. M. Thorup and U. Zwick. Approximate distance oracles. JACM, 52(1):1-24, 2005.
48. D. P. Woodruff. Lower bounds for additive spanners, emulators, and more. In FOCS, pages 389-398, 2006. (Pubitemid 351175527)
49. A. C.-C. Yao. Space-time tradeoff for answering range queries (extended abstract). In STOC, pages 128-136, 1982.
50. U. Zwick. Exact and approximate distances in graphs - A survey. Lecture Notes in Computer Science, 2161:33+, 2001.