The Power of Dynamic Distance Oracles

DOI10.1145/2746539.2746615MaRDI QIDQ2941483zbMATH OpenOpenAlexFDO

Authors Jakub Łącki, Jakub Oćwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1308.3336

zbMATH Keywords

approximationSteiner treedynamic algorithmdynamic distance oracles

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distance in graphs (05C12) Signed and weighted graphs (05C22)

Abstract: In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n$-vertex graph $G=(V,E,w)$ with positive real edge weights, and our goal is to maintain a tree which is a good approximation of the minimum Steiner tree spanning a terminal set $SsubseteqV$, which changes over time. The changes applied to the terminal set are either terminal additions (incremental scenario), terminal removals (decremental scenario), or both (fully dynamic scenario). Our task here is twofold. We want to support updates in sublinear $o(n)$ time, and keep the approximation factor of the algorithm as small as possible. We show that we can maintain a $(6+varepsilon)$-approximate Steiner tree of a general graph in $ildeO(sqrtnlogD)$ time per terminal addition or removal. Here, $D$ denotes the stretch of the metric induced by $G$. For planar graphs we achieve the same running time and the approximation ratio of $(2+varepsilon)$. Moreover, we show faster algorithms for incremental and decremental scenarios. Finally, we show that if we allow higher approximation ratio, even more efficient algorithms are possible. In particular we show a polylogarithmic time $(4+varepsilon)$-approximate algorithm for planar graphs. One of the main building blocks of our algorithms are dynamic distance oracles for vertex-labeled graphs, which are of independent interest. We also improve and use the online algorithms for the Steiner tree problem.

Recommendations

• A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
• scientific article; zbMATH DE number 4063109
• scientific article; zbMATH DE number 1424548
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• On efficient implementation of an approximation algorithm for the Steiner tree problem
• A faster approximation algorithm for the Steiner tree problem in graphs
• scientific article; zbMATH DE number 169458

Cites work

• Approximate distance oracles
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Fast C-K-R partitions of sparse graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On approximate distance labels and routing schemes with affine stretch
• On sparse spanners of weighted graphs
• Ramsey partitions and proximity data structures
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• Shortest-path queries in static networks

Cited in

(14)

• Approximate distance oracles with improved stretch for sparse graphs
• Approximate distance oracles with improved stretch for sparse graphs
• Decremental SPQR-trees for Planar Graphs
• Robust online algorithms for dynamic choosing problems
• The nearest colored node in a tree
• Online Steiner tree with deletions
• Symmetry exploitation for online machine covering with bounded migration
• Fully dynamic algorithms for Euclidean Steiner tree
• scientific article; zbMATH DE number 7758339 (Why is no real title available?)
• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• A local-search algorithm for Steiner forest
• A theory and algorithms for combinatorial reoptimization
• Online facility location with deletions
• Succinct data structures for nearest colored node in a tree

Describes a project that uses

Uses Software

• Graphs

This page was built for publication: The Power of Dynamic Distance Oracles

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