Skip to main content
SpringerLink
Log in

Transitive-Closure Spanners: A Survey

  • Chapter
Property Testing

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6390))

Abstract

We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V,E) and an integer k ≥ 1, a k-transitive-closure-spanner ( k-TC-spanner) of G is a directed graph H = (V, E H ) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were studied implicitly in different areas of computer science, and properties of these spanners have been rediscovered over the span of 20 years. The common task implicitly tackled in these diverse applications can be abstracted as the problem of constructing sparse TC-spanners.

In this article, we survey combinatorial bounds on the size of sparsest TC-spanners, and algorithms and inapproximability results for the problem of computing the sparsest TC-spanner of a given directed graph. We also describe multiple applications of TC-spanners, including property testing, property reconstruction, key management in access control hierarchies and data structures.

Parts of this survey are adapted from [15,16,17,14].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, I., Gavoille, C.: Object location using path separators. In: PODC, pp. 188–197 (2006)

    Google Scholar 

  2. Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131–137 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Property-preserving data reconstruction. Algorithmica 51(2), 160–182 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ailon, N., Chazelle, B.: Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. 204(11), 1704–1717 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Tech. Rep. 71/87, Tel-Aviv University (1987)

    Google Scholar 

  6. Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry 9(1), 81–100 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. ACM Trans. Inf. Syst. Secur. 12(3), 1–43 (2009)

    Article  Google Scholar 

  8. Atallah, M.J., Blanton, M., Frikken, K.B.: Key management for non-tree access hierarchies. In: SACMAT, pp. 11–18 (2006)

    Google Scholar 

  9. Atallah, M.J., Frikken, K.B., Blanton, M.: Dynamic and efficient key management for access hierarchies. In: ACM Conference on Computer and Communications Security, pp. 190–202 (2005)

    Google Scholar 

  10. Awerbuch, B.: Communication-time trade-offs in network synchronization. In: PODC, pp. 272–276 (1985)

    Google Scholar 

  11. Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected \(\tilde{O} (n^2)\) time. ACM Transactions on Algorithms 2(4), 557–577 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Batu, T., Rubinfeld, R., White, P.: Fast approximate PCPs for multidimensional bin-packing problems. Inf. Comput. 196(1), 42–56 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Berman, P., Raskhodnikova, S., Ruan, G.: Finding sparser directed spanners (2010) (manuscript)

    Google Scholar 

  14. Bhattacharyya, A., Grigorescu, E., Jha, M., Jung, K., Raskhodnikova, S., Woodruff, D.: Lower bounds for local monotonicity reconstruction from transitive-closure spanners. In: RANDOM (2010)

    Google Scholar 

  15. Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.: Transitive-closure spanners. In: SODA, pp. 932–941 (2009)

    Google Scholar 

  16. Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.: Transitive-closure spanners of the hypercube and the hypergrid (2009), eCCC Report TR09-046

    Google Scholar 

  17. Bhattacharyya, A., Grigorescu, E., Raskhodnikova, S., Woodruff, D.: Steiner transitive-closure spanners of d-dimensional posets (2010) (manuscript)

    Google Scholar 

  18. Bodlaender, H.L., Tel, G., Santoro, N.: Tradeoffs in non-reversing diameter. Nordic Journal of Computing 1(1), 111–134 (1994)

    MathSciNet  MATH  Google Scholar 

  19. Chazelle, B.: Computing on a free tree via complexity-preserving mappings. Algorithmica 2, 337–361 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  20. Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28(1), 210–236 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  21. Cohen, E.: Polylog-time and near-linear work approximation scheme for undirected shortest paths. JACM 47(1), 132–166 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Cowen, L.: Compact routing with minimum stretch. J. Algorithms 38(1), 170–183 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Cowen, L., Wagner, C.G.: Compact roundtrip routing in directed networks. J. Algorithms 50(1), 79–95 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  24. Dilworth, R.P.: A decomposition theorem for partially ordered sets. The Annals of Mathematics, Second Series 51(1), 161–166 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  25. Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 97–108. Springer, Heidelberg (1999)

    Google Scholar 

  26. Dushnik, B., Miller, E.: Concerning similarity transformations of linearly ordered sets. Bulletin Amer. Math. Soc. 46, 322–326 (1940)

    Article  MathSciNet  MATH  Google Scholar 

  27. Elkin, M.: Computing almost shortest paths. In: PODC, pp. 53–62 (2001)

    Google Scholar 

  28. Elkin, M., Peleg, D.: Strong inapproximability of the basic k-spanner problem. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 636–647. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  29. Elkin, M., Peleg, D.: The client-server 2-spanner problem with applications to network design. In: SIROCCO, pp. 117–132 (2001)

    Google Scholar 

  30. Elkin, M., Peleg, D.: The hardness of approximating spanner problems. Theory Comput. Syst. 41(4), 691–729 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  31. Ergun, F., Kannan, S., Kumar, S.R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. JCSS 60(3), 717–751 (2000)

    MathSciNet  MATH  Google Scholar 

  32. Fischer, E.: On the strength of comparisons in property testing. Inf. Comput. 189(1), 107–116 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  33. Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. In: STOC, pp. 474–483 (2002)

    Google Scholar 

  34. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. JACM 45(4), 653–750 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  35. Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica 20(3), 301–337 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  36. Halevy, S., Kushilevitz, E.: Testing monotonicity over graph products. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 721–732. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  37. Hesse, W.: Directed graphs requiring large numbers of shortcuts. In: SODA, pp. 665–669 (2003)

    Google Scholar 

  38. Hochbaum, D. (ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston (1997)

    MATH  Google Scholar 

  39. Jha, M., Raskhodnikova, S.: Testing and reconstruction of lipschitz functions with applications to data privacy (2010) (manuscript)

    Google Scholar 

  40. Kortsarz, G.: On the hardness of approximating spanners. Algorithmica 30(3), 432–450 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  41. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36(2), 177–189 (1979), http://www.jstor.org/stable/2100927

    Article  MathSciNet  MATH  Google Scholar 

  42. Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)

    Book  MATH  Google Scholar 

  43. Peleg, D., Schäffer, A.A.: Graph spanners. Journal of Graph Theory 13(1), 99–116 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  44. Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18(4), 740–747 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  45. Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. JACM 36(3), 510–530 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  46. Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. In: SODA, pp. 844–851 (2002)

    Google Scholar 

  47. Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 252–271 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  48. Saks, M.E., Seshadhri, C.: Parallel monotonicity reconstruction. In: Proceedings of the 19th Annual Symposium on Discrete Algorithms (SODA), pp. 962–971 (2008)

    Google Scholar 

  49. Santis, A.D., Ferrara, A.L., Masucci, B.: Efficient provably-secure hierarchical key assignment schemes. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 371–382. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  50. Seidel, R.: Understanding the inverse Ackermann function (2006), http://cgi.di.uoa.gr/~ewcg06/invited/Seidel.pdf

  51. Soriano, D.G., Matsliah, A., Chakraborty, S., Briet, J.: Monotonicity testing and shortest-path routing on the cube (2010), eCCC Report TR10-048

    Google Scholar 

  52. Thorup, M.: On shortcutting digraphs. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp. 205–211. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  53. Thorup, M.: Shortcutting planar digraphs. Combinatorics, Probability & Computing 4, 287–315 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  54. Thorup, M.: Parallel shortcutting of rooted trees. J. Algorithms 23(1), 139–159 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  55. Thorup, M., Zwick, U.: Compact routing schemes. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 1–10 (2001), http://citeseer.ist.psu.edu/thorup01compact.html

  56. Thorup, M., Zwick, U.: Approximate distance oracles. JACM 52(1), 1–24 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  57. Trotter, W. (ed.): Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins University Press, Baltimore (1992)

    MATH  Google Scholar 

  58. Woodruff, D.P.: Lower bounds for additive spanners, emulators, and more. In: FOCS, pp. 389–398 (2006)

    Google Scholar 

  59. Yannakakis, M.: The complexity of the partial order dimension problem. JMAA 3(3), 351–358 (1982)

    MathSciNet  MATH  Google Scholar 

  60. Yao, A.C.C.: Space-time tradeoff for answering range queries (extended abstract). In: STOC, pp. 128–136 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pennsylvania State University, USA

    Sofya Raskhodnikova

Authors
  1. Sofya Raskhodnikova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, 76100, Rehovot, Israel

    Oded Goldreich

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Raskhodnikova, S. (2010). Transitive-Closure Spanners: A Survey. In: Goldreich, O. (eds) Property Testing. Lecture Notes in Computer Science, vol 6390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16367-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16367-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16366-1

  • Online ISBN: 978-3-642-16367-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation