Reachability preservers: new extremal bounds and approximation algorithms

MaRDI QIDQ4608011zbMATH OpenFDO

Authors Amir Abboud, Greg Bodwin

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1710.11250, http://dl.acm.org/citation.cfm?id=3175427

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Abstract: We abstract and study emph{reachability preservers}, a graph-theoretic primitive that has been implicit in prior work on network design. Given a directed graph $G=(V,E)$ and a set of emph{demand pairs} $PsubseteqVimesV$, a reachability preserver is a sparse subgraph $H$ that preserves reachability between all demand pairs. Our first contribution is a series of extremal bounds on the size of reachability preservers. Our main result states that, for an $n$-node graph and demand pairs of the form $PsubseteqSimesV$ for a small node subset $S$, there is always a reachability preserver on $O(n+sqrtn|P||S|)$ edges. We additionally give a lower bound construction demonstrating that this upper bound characterizes the settings in which $O(n)$ size reachability preservers are generally possible, in a large range of parameters. The second contribution of this paper is a new connection between extremal graph sparsification results and classical Steiner Network Design problems. Surprisingly, prior to this work, the osmosis of techniques between these two fields had been superficial. This allows us to improve the state of the art approximation algorithms for the most basic Steiner-type problem in directed graphs from the $O(n^{0.6+varepsilon})$ of Chlamatac, Dinitz, Kortsarz, and Laekhanukit (SODA'17) to $O(n^{4/7+varepsilon})$.

Recommendations

• Approximating spanners and directed Steiner forest. Upper and lower bounds
• Approximating spanners and directed Steiner forest: upper and lower bounds
• New results on linear size distance preservers
• Sparse Sourcewise and Pairwise Distance Preservers
• Improved approximation for the directed spanner problem

Cited in

(14)

• Graph spanners: a tutorial review
• A note on distance-preserving graph sparsification
• Near isometric terminal embeddings for doubling metrics
• ETH-hardness of approximating 2-CSPs and directed Steiner network
• Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network
• Near isometric terminal embeddings for doubling metrics
• Improved guarantees for vertex sparsification in planar graphs
• New extremal bounds for reachability and strong-connectivity preservers under failures
• Finding smallest witnesses for conjunctive queries
• Are there graphs whose shortest path structure requires large edge weights?
• New extremal bounds for reachability and strong-connectivity preservers under failures
• The strongish planted clique hypothesis and its consequences
• Approximation algorithms for directed weighted spanners
• Directed buy-at-bulk spanners

This page was built for publication: Reachability preservers: new extremal bounds and approximation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608011)