# A local algorithm for constructing spanners in minor-free graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

## Abstract

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. We consider this problem in the setting of local algorithms: one wants to quickly determine whether a given edge e is in a specific spanning tree, without computing the whole spanning tree, but rather by inspecting the local neighborhood of e. The challenge is to maintain consistency. That is, to answer queries about different edges according to the same spanning tree. Since it is known that this problem cannot be solved without essentially viewing all the graph, we consider the relaxed version of finding a spanning subgraph with (1+ϵ)n edges instead of n-1 edges (where n is the number of vertices and ϵ is a given approximation/sparsity parameter). It is known that this relaxed problem requires inspecting (p n) edges in general graphs (for any constant ϵ), which motivates the study of natural restricted families of graphs. One such family is the family of graphs with an excluded minor (which in particular includes planar graphs). For this family there is an algorithm that achieves constant success probability, and inspects (d/ϵ)poly(h) log(1/ϵ) edges (for each edge it is queried on), where d is the maximum degree in the graph and h is the size of the excluded minor. The distances between pairs of vertices in the spanning subgraph G′ are at most a factor of poly(d, 1/ϵ, h) larger than in G. In this work, we show that for an input graph that is H-minor free for any H of size h, this task can be performed by inspecting only poly(d, 1/ϵ, h) edges in G. The distances between pairs of vertices in the spanning subgraph G′ are at most a factor of O∼(h log(d)/ ϵ) larger than in G. Furthermore, the error probability of the new algorithm is significantly improved to Θ(1/n). This algorithm can also be easily adapted to yield an efficient algorithm for the distributed (message passing) setting.

Original language English Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016 Klaus Jansen, Claire Mathieu, Jose D. P. Rolim, Chris Umans Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing 9783959770187 https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.38 Published - 1 Sep 2016 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 - Paris, FranceDuration: 7 Sep 2016 → 9 Sep 2016

### Publication series

Name Leibniz International Proceedings in Informatics, LIPIcs 60 1868-8969

### Conference

Conference 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 France Paris 7/09/16 → 9/09/16

## Keywords

• Excluded-Minor
• Local Algorithms
• Spanners
• Sparse Subgraphs

## Fingerprint

Dive into the research topics of 'A local algorithm for constructing spanners in minor-free graphs'. Together they form a unique fingerprint.