Results 1  10
of
37
Transitiveclosure spanners
, 2008
"... We define the notion of a transitiveclosure spanner of a directed graph. Given a directed graph G = (V, E) and an integer k ≥ 1, a ktransitiveclosurespanner (kTCspanner) of G is a directed graph H = (V, EH) that has (1) the same transitiveclosure as G and (2) diameter at most k. These spanner ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
(Show Context)
We define the notion of a transitiveclosure spanner of a directed graph. Given a directed graph G = (V, E) and an integer k ≥ 1, a ktransitiveclosurespanner (kTCspanner) of G is a directed graph H = (V, EH) that has (1) the same transitiveclosure as G and (2) diameter at most k. These spanners were studied implicitly in access control, property testing, and data structures, and properties of these spanners have been rediscovered over the span of 20 years. We bring these areas under the unifying framework of TCspanners. We abstract the common task implicitly tackled in these diverse applications as the problem of constructing sparse TCspanners. We study the approximability of the size of the sparsest kTCspanner for a given digraph. Our technical contributions fall into three categories: algorithms for general digraphs,
New Constructions of (α, β)Spanners and Purely Additive Spanners
, 2005
"... An ¦ α § β ¨spanner of an unweighted graph G is a subgraph H that approximates distances in G in the following sense. For any two vertices u § v: δH ¦ u § v¨� © αδG ¦ u § v¨� � β, where δG is the distance w.r.t. G. It is well known that there exist (multiplicative) ¦ 2k � 1 § 0 ¨spanners of size ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
(Show Context)
An ¦ α § β ¨spanner of an unweighted graph G is a subgraph H that approximates distances in G in the following sense. For any two vertices u § v: δH ¦ u § v¨� © αδG ¦ u § v¨� � β, where δG is the distance w.r.t. G. It is well known that there exist (multiplicative) ¦ 2k � 1 § 0 ¨spanners of size O ¦ n 1 � 1 � k ¨ and that there exist (purely additive) ¦ 1 § 2 ¨spanners of size O ¦ n 3 � 2 ¨. However no other ¦ 1 § O ¦ 1¨� ¨spanners are known to exist. In this paper we develop a couple new techniques for constructing ¦ α § β ¨spanners. The first result is a purely additive ¦ 1 § 6 ¨spanner of size O ¦ n 4 � 3 ¨. Our construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively wellapproximated by paths already purchased. This general approach should lead to new spanner constructions. The second result is a truly simple linear time construction of ¦ k § k � 1 ¨spanners with size O ¦ n 1 � 1 � k ¨. In a distributed network the algorithm terminates in a constant number of rounds and has expected size O ¦ n 1 � 1 � k ¨. The new idea here is primarily in the analysis of the construction. We show that a few simple and local rules for picking spanner edges induce seemingly coordinated global behavior.
Low Distortion Spanners
"... Abstract. A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G is an fspanner of G if any two vertices u, v at distance d in G are at distance at most f(d) in H. There is clearl ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
(Show Context)
Abstract. A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G is an fspanner of G if any two vertices u, v at distance d in G are at distance at most f(d) in H. There is clearly some tradeoff between the sparsity of H and the distortion function f, though the nature of this tradeoff is still poorly understood. In this paper we present a simple, modular framework for constructing sparse spanners that is based on interchangable components called connection schemes. By assembling connection schemes in different ways we can recreate the additive 2 and 6spanners of Aingworth et al. and Baswana et al. and improve on the (1+ɛ, β)spanners of Elkin and Peleg, the sublinear additive spanners of Thorup and Zwick, and the (non constant) additive spanners of Baswana et al. Our constructions rival the simplicity of all comparable algorithms and provide substantially better spanners, in some cases reducing the density doubly exponentially. 1
Lower Bounds for Additive Spanners, Emulators, and More
"... An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For ln n every k = O (), we construct a graph G on n vertices ln ln n for which any additive spanner of G with distortion 2k − 1 has Ω ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For ln n every k = O (), we construct a graph G on n vertices ln ln n for which any additive spanner of G with distortion 2k − 1 has Ω ( 1 k n1+1/k) edges. This matches the lower bound previously known only to hold under a 1963 conjecture of Erdös. We generalize our lower bound in a number of ways. First, we consider graph emulators introduced by Dor, Halperin, and Zwick (FOCS, 1996), where an emulator of an unweighted undirected graph G with distortion d is like an additive spanner except H may be an arbitrary weighted graph such that δG(u, v) ≤ δH(u, v) ≤ δG(u, v) + d. We show a lower bound of Ω ( 1 k 2 n 1+1/k) edges for distortion(2k − 1) emulators. These are the first nontrivial bounds for k> 3. Second, we parameterize our bounds in terms of the minimum degree of the graph. Namely, for minimum degree n 1/k+c for any c ≥ 0, we prove a bound of Ω ( 1 k n1+1/k−c(1+2/(k−1)) ) for additive spanners and Ω ( 1 k 2 n 1+1/k−c(1+2/(k−1)) ) for emulators. For k = 2 these can be improved to Ω(n 3/2−c). This partially answers a question of Baswana et al (SODA, 2005) for additive spanners. Finally, we continue the study of pairwise and sourcewise distance preservers defined by Coppersmith and Elkin (SODA, 2005) by considering their approximate variants and their relaxation to emulators. We prove the first lower bounds for such graphs.
Efficient algorithms for constructing (1 + ɛ, β)spanners in the distributed and streaming models
 Distributed Computing
, 2004
"... For an unweighted undirected graph G = (V, E), and a pair of positive integers α ≥ 1, β ≥ 0, a subgraph G ′ = (V, H), H ⊆ E, is called an (α, β)spanner of G if for every pair of vertices u, v ∈ V, distG ′(u, v) ≤ α · distG(u, v) + β. It was shown in [20] that for any ɛ> 0, κ = 1, 2,..., there ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
For an unweighted undirected graph G = (V, E), and a pair of positive integers α ≥ 1, β ≥ 0, a subgraph G ′ = (V, H), H ⊆ E, is called an (α, β)spanner of G if for every pair of vertices u, v ∈ V, distG ′(u, v) ≤ α · distG(u, v) + β. It was shown in [20] that for any ɛ> 0, κ = 1, 2,..., there exists an integer β = β(ɛ, κ) such that for every nvertex graph G there exists a (1 + ɛ, β)spanner G ′ with O(n 1+1/κ) edges. An efficient distributed protocol for constructing (1+ ɛ, β)spanners was devised in [18]. The running time and the communication complexity of that protocol are O(n 1+ρ) and O(En ρ), respectively, where ρ is an additional control parameter of the protocol that affects only the additive term β. In this paper we devise a protocol with a drastically improved running time (O(n ρ) as opposed to O(n 1+ρ)) for constructing (1 + ɛ, β)spanners. Our protocol has the same communication complexity as the protocol of [18], and it constructs spanners with essentially the same properties as the spanners that are constructed by the protocol of [18]. We also show that our protocol for constructing (1+ɛ, β)spanners can be adapted to the streaming model, and devise a streaming algorithm that uses a constant number of passes and O(n 1+1/κ · log n) bits of space for computing allpairsalmostshortestpaths of length at most by a multiplicative factor (1 + ɛ) and an additive term of β greater than the shortest paths. Our algorithm processes each edge in time O(n ρ), for an arbitrarily small ρ> 0. The only
Lower bounds for local monotonicity reconstruction from transitiveclosure spanners
, 2010
"... Given a directed graph G = (V, E) and an integer k ≥ 1, a ktransitiveclosurespanner (kTCspanner) of G is a directed graph H = (V, EH) that has (1) the same transitiveclosure as G and (2) diameter at most k. Transitiveclosure spanners are a common abstraction for applications in access contr ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
(Show Context)
Given a directed graph G = (V, E) and an integer k ≥ 1, a ktransitiveclosurespanner (kTCspanner) of G is a directed graph H = (V, EH) that has (1) the same transitiveclosure as G and (2) diameter at most k. Transitiveclosure spanners are a common abstraction for applications in access control, property testing and data structures. We show a connection between 2TCspanners and local monotonicity reconstructors. A local monotonicity reconstructor, introduced by Saks and Seshadhri (SIAM Journal on Computing, 2010), is a randomized algorithm that, given access to an oracle for an almost monotone function f: [m] d → R, can quickly evaluate a related function g: [m] d → R which is guaranteed to be monotone. Furthermore, the reconstructor can be implemented in a distributed manner. We show that an efficient local monotonicity reconstructor implies a sparse 2TCspanner of the directed hypergrid (hypercube), providing a new technique for proving lower bounds for local monotonicity reconstructors. Our connection is,
Additive Spanners and (α, β)Spanners
"... An (α, β)spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of α and an additive term β. It is well known that any graph contains a (multiplicative) (2k − 1, 0)spanner of size O(n 1+1/k) and an (additive) (1, 2)spanner of size O(n 3/2). How ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
(Show Context)
An (α, β)spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of α and an additive term β. It is well known that any graph contains a (multiplicative) (2k − 1, 0)spanner of size O(n 1+1/k) and an (additive) (1, 2)spanner of size O(n 3/2). However no other additive spanners are known to exist. In this paper we develop a couple of new techniques for constructing (α, β)spanners. Our first result is an additive (1, 6)spanner of size O(n 4/3). The construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively wellapproximated by paths already purchased. We show that this path buying algorithm can be parameterized in different ways to yield other sparsenessdistortion tradeoffs. Our second result addresses the problem of which (α, β)spanners can be computed efficiently, ideally in linear time. We show that for any k, a (k, k − 1)spanner with size O(kn 1+1/k) can be found in linear time, and further, that in a distributed network the algorithm terminates in a constant number of rounds. Previous spanner constructions with similar performance had roughly twice the multiplicative distortion.
Distributed Algorithms for Ultrasparse Spanners and Linear Size Skeletons
"... We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some nontrivial lower bounds on the tradeoff between time, sparseness, and distortion. All of our algorithms assume a synchronized distributed network, where relatively short messages ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some nontrivial lower bounds on the tradeoff between time, sparseness, and distortion. All of our algorithms assume a synchronized distributed network, where relatively short messages may be communicated in each time step. Our first result is a fast distributed algorithm for finding an O(2 log ∗ n log n)spanner with size O(n). Besides being nearly optimal in time and distortion, this algorithm appears to be the first that constructs an O(n)size skeleton without requiring unbounded length messages or time proportional to the diameter of the network. Our second result is a new class of efficiently constructible (α, β)spanners called Fibonacci spanners whose distortion improves with the distance being approximated. At their sparsest Fibonacci spanners can have nearly linear size O(n(log log n) φ) where φ = 1+ √ 5 2 is the golden ratio. As the distance increases the Fibonacci spanner’s multiplicative distortion passes through four discrete stages, moving from logarithmic to loglogarithmic, then into a period where it is constant, tending to 3, followed by another period tending to 1. On the lower bound side we prove that many recent sequential spanner constructions have no efficient counterparts in distributed networks, even if the desired distortion only needs to be achieved on the average or for a tiny fraction of the vertices. In particular, any distance preservers, purely additive spanners, or spanners with sublinear additive distortion must either be very dense, slow to construct, or have very weak guarantees on distortion. 1
TransitiveClosure Spanners: A Survey
"... We survey results on transitiveclosure spanners and their applications. Given a directed graph G = (V, E) and an integer k ≥ 1, a ktransitiveclosurespanner (kTCspanner) of G is a directed graph H = (V, EH) that has (1) the same transitiveclosure as G and (2) diameter at most k. These spanner ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
We survey results on transitiveclosure spanners and their applications. Given a directed graph G = (V, E) and an integer k ≥ 1, a ktransitiveclosurespanner (kTCspanner) of G is a directed graph H = (V, EH) that has (1) the same transitiveclosure 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 TCspanners. In this article, we survey combinatorial bounds on the size of sparsest TCspanners, and algorithms and inapproximability results for the problem of computing the sparsest TCspanner of a given directed graph. We also describe multiple applications of TCspanners, including property testing, property reconstruction, key management in access control hierarchies and data structures.
Fast deterministic distributed algorithms for sparse spanners
 IN 13 TH INTERNATIONAL COLLOQUIUM ON STRUCTURAL INFORMATION & COMMUNICATION COMPLEXITY (SIROCCO
, 2006
"... This paper concerns the efficient construction of sparse and low stretch spanners for unweighted arbitrary graphs with n nodes. All previous deterministic distributed algorithms, for constant stretch spanner of o(n²) edges, have a running time Ω(n^ɛ) for some constant ɛ > 0 depending on the stret ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
This paper concerns the efficient construction of sparse and low stretch spanners for unweighted arbitrary graphs with n nodes. All previous deterministic distributed algorithms, for constant stretch spanner of o(n²) edges, have a running time Ω(n^ɛ) for some constant ɛ > 0 depending on the stretch. Our deterministic distributed algorithms construct constant stretch spanners of o(n²) edges in o(n^ɛ) time for any constant ɛ > 0. More precisely, in the Linial’s free model, we construct in n O(1/ √ log n) time, for every graph, a 5spanner of O(n 3/2) edges. The result is extended to O(k 2.322)spanners with O(n 1+1/k) edges for every parameter k � 1. If the minimum degree of the graph is Ω(√n), then, in the same time complexity, a 9spanner with O(n) edges can be constructed.