作者
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David Woodruff
发表日期
2010/9
研讨会论文
International Workshop on Randomization and Computation
简介
Given a directed graph and an integer , a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph that has (1) the same transitive-closure as G and (2) diameter at most k. Transitive-closure spanners are used in access control, property testing and data structures. We show a connection between 2-TC-spanners and local monotonicity filters. A local monotonicity filter, introduced by Saks and Seshadhri [SIAM J. Comput., pp. 2897–2926], is a randomized algorithm that, given access to an oracle for an almost monotone function , can quickly evaluate a related function which is guaranteed to be monotone. Furthermore, the filter can be implemented in a distributed manner. We show that an efficient local monotonicity filter implies a sparse 2-TC-spanner of the directed hypergrid, providing a new technique for proving lower bounds for local …
引用总数
2010201120122013201420152016201720182019202020212022202342464213515135
学术搜索中的文章
A Bhattacharyya, E Grigorescu, M Jha, K Jung… - SIAM Journal on Discrete Mathematics, 2012
A Bhattacharyya, E Grigorescu, M Jha, K Jung… - … : 13th International Workshop, APPROX 2010, and 14th …, 2010