Recently Elkin and Solomon gave a construction of spanners for doubling metrics that has constant maximum degree, hop-diameter O(log n) and lightness O(log n) (i.e., weight O(log n)·w(MST)). This resolves a long standing conjecture proposed by Arya et al. in a seminal STOC 1995 paper. However, Elkin and Solomon’s spanner construction is extremely complicated; we offer a simple alternative construction that is very intuitive and is based on the standard technique of net tree with cross edges. Indeed, our approach can be readily applied to our previous construction of k-fault tolerant spanners (ICALP 2012) to achieve k-fault tolerance, maximum degree O(k2), hop-diameter O(log n) and lightness O(k3 log n). ∗Department of Computer Science, The ...
© Copyright 2018 by SIAM. A k-spanner of a graph G is a sparse subgraph H whose shortest path distan...
One goal in network design is the construction of sparse networks that guarantee short distances wit...
Resolving an open question from 2006 [Damian et al., 2006], we prove the existence of light-weight b...
Lecture Notes in Computer Science, vol. 7965 entitled: Automata, languages, and programming : 40th i...
Session A6Lecture Notes in Computer Science, Vol. 7391 entitled: Automata, Languages, and Programmin...
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that co...
Given a metric M = (V, d), a graph G = (V,E) is a t-spanner for M if every pair of nodes in V has a ...
This paper presents a distributed algorithm that runs on an n-node unit ball graph (UBG) G residing ...
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted un...
Abstract. This paper presents a distributed algorithm that runs on an n-node unit ball graph (UBG) G...
Given a metric M=(V,d), a graph G=(V,E) is a t-spanner for M if every pair of nodes in V has a "shor...
The degree, the (hop-)diameter, and the weight are the most basic and well-studied parameters of geo...
Resolving an open question from 2006, we prove the existence of light-weight bounded-degree spanners...
Given a metric M = (V, d), a graph G = (V, E) is a t-spanner for M if every pair of nodes in V has a...
Given a metric M = (V, d), a graph G = (V, E) is a t-spanner for M if every pair of nodes in V has a...
© Copyright 2018 by SIAM. A k-spanner of a graph G is a sparse subgraph H whose shortest path distan...
One goal in network design is the construction of sparse networks that guarantee short distances wit...
Resolving an open question from 2006 [Damian et al., 2006], we prove the existence of light-weight b...
Lecture Notes in Computer Science, vol. 7965 entitled: Automata, languages, and programming : 40th i...
Session A6Lecture Notes in Computer Science, Vol. 7391 entitled: Automata, Languages, and Programmin...
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that co...
Given a metric M = (V, d), a graph G = (V,E) is a t-spanner for M if every pair of nodes in V has a ...
This paper presents a distributed algorithm that runs on an n-node unit ball graph (UBG) G residing ...
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted un...
Abstract. This paper presents a distributed algorithm that runs on an n-node unit ball graph (UBG) G...
Given a metric M=(V,d), a graph G=(V,E) is a t-spanner for M if every pair of nodes in V has a "shor...
The degree, the (hop-)diameter, and the weight are the most basic and well-studied parameters of geo...
Resolving an open question from 2006, we prove the existence of light-weight bounded-degree spanners...
Given a metric M = (V, d), a graph G = (V, E) is a t-spanner for M if every pair of nodes in V has a...
Given a metric M = (V, d), a graph G = (V, E) is a t-spanner for M if every pair of nodes in V has a...
© Copyright 2018 by SIAM. A k-spanner of a graph G is a sparse subgraph H whose shortest path distan...
One goal in network design is the construction of sparse networks that guarantee short distances wit...
Resolving an open question from 2006 [Damian et al., 2006], we prove the existence of light-weight b...