Steiner transitive-closure spanners of low-dimensional posets
- 97 Downloads
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, EH) that has (1) the same transitive closure as G and (2) diameter at most k. In some applications, the shortcut paths added to the graph in order to obtain small diameter can use Steiner vertices, that is, vertices not in the original graph G. The resulting spanner is called a Steiner transitive-closure spanner (Steiner TC-spanner).
Motivated by applications to property reconstruction and access control hierarchies, we concentrate on Steiner TC-spanners of directed acyclic graphs or, equivalently, partially ordered sets. In these applications, the goal is to find a sparsest Steiner k-TC-spanner of a poset G for a given k and G. The focus of this paper is the relationship between the dimension of a poset and the size of its sparsest Steiner TC-spanner. The dimension of a poset G is the smallest d such that G can be embedded into a d-dimensional directed hypergrid via an order-preserving embedding.
We present a nearly tight lower bound on the size of Steiner 2-TC-spanners of d- dimensional directed hypergrids. It implies better lower bounds on the complexity of local reconstructors of monotone functions and functions with small Lipschitz constant. The lower bound is derived from an explicit dual solution to a linear programming relaxation of the Steiner 2-TC-spanner problem. We also give an efficient construction of Steiner 2-TC-spanners, of size matching the lower bound, for all low-dimensional posets. Finally, we present a lower bound on the size of Steiner k-TC-spanners of d-dimensional posets. It shows that the best-known construction, due to De Santis et al., cannot be improved significantly.
Mathematics Subject Classification (2000)6BR10
Unable to display preview. Download preview PDF.
- N. Alon and B. Schieber: Optimal preprocessing for answering on-line product queries, Technical Report 71/87, Tel-Aviv University, 1987.Google Scholar
- M. J. Atallah, M. Blanton, N. Fazio and K. B. Frikken: Dynamic and efficient key management for access hierarchies, ACM Trans. Inf. Syst. Secur. 912 2009.Google Scholar
- M. J. Atallah, K. B. Frikken and M. Blanton: Dynamic and efficient key management for access hierarchies, in V. Atluri, C. Meadows, and A. Juels, editors, ACM Conference on Computer and Communications Security, 190–202, ACM, 2005.Google Scholar
- B. Awerbuch: Communication-time trade-offs in network synchronization, in: PODC, 272–276, 1985.Google Scholar
- P. Berman, A. Bhattacharyya, E. Grigorescu, S. Raskhodnikova, D. P. Woodruff and G. Yaroslavtsev: Steiner transitive-closure spanners of low-dimensional posets, in: L. Aceto, M. Henzinger, and J. Sgall, editors, ICALP (1), volume 6755 of Lecture Notes in Computer Science, 760–772, Springer, 2011.Google Scholar
- A. K. Chandra, S. Fortune and R. J. Lipton: Lower bounds for constant depth circuits for prefix problems, in: J. Díaz, editor, ICALP, volume 154 of LNCS, 109–117, Springer, 1983.Google Scholar
- Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron and A. Samorodnitsky: Improved testing algorithms for monotonicity, in: RANDOM, 97–108, 1999.Google Scholar
- W. Hesse: Directed graphs requiring large numbers of shortcuts, in: SODA, 665–669, ACM/SIAM, 2003.Google Scholar
- M. Jha and S. Raskhodnikova: Testing and reconstruction of Lipschitz functions with applications to data privacy, in: R. Ostrovsky, editor, FOCS, 433–442, IEEE, 2011.Google Scholar
- S. Raskhodnikova: Transitive-closure spanners: A survey, in: O. Goldreich, editor, Property Testing, volume 6390 of LNCS, 167–196, Springer, 2010.Google Scholar
- M. Thorup: On shortcutting digraphs, in: E. W. Mayr, editor, WG, volume 657 of LNCS, 205–211, Springer, 1992.Google Scholar
- A. C.-C. Yao: Space-time tradeoff for answering range queries (extended abstract), in: H. R. Lewis, B. B. Simons, W. A. Burkhard, and L. H. Landweber, editors, STOC, 128–136, ACM, 1982.Google Scholar