English

A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners

Data Structures and Algorithms 2009-09-29 v1
Authors: Michael Elkin
View on arXiv ↗ PDF ↗

Abstract

In this paper we devise an extremely efficient fully dynamic distributed algorithm for maintaining sparse spanners. Our resuls also include the first fully dynamic centralized algorithm for the problem with non-trivial bounds for both incremental and decremental update. Finally, we devise a very efficient streaming algorithm for the problem.

Keywords

distributed optimization sparse optimization data stream processing

Cite

@article{arxiv.cs/0611001,
  title  = {A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners},
  author = {Michael Elkin},
  journal= {arXiv preprint arXiv:cs/0611001},
  year   = {2009}
}

Related papers

View all related →
Distributed, Parallel, and Cluster Computing · Computer Science
Fully Sequential and Distributed Dynamic Algorithms for Minimum Spanning Trees
Pradosh Kumar Mohapatra
2007-05-23
Machine Learning · Computer Science
Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layers
Junjie Liu, Zhe Xu, Runbin Shi, Ray C. C. Cheung +1
2020-05-15
Data Structures and Algorithms · Computer Science
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams +1
2021-09-21
Data Structures and Algorithms · Computer Science
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng +1
2020-05-06
Signal Processing · Electrical Eng. & Systems
A Fast Converging Distributed Solver for Linear Systems with Generalised Diagonal Dominance
Qianqian Cai, Zhaorong Zhang, Minyue Fu
2019-04-30
Optimization and Control · Mathematics
Distributed and Anytime Algorithm for Network Optimization Problems with Separable Structure
Pol Mestres, Jorge Cortés
2023-09-07
Data Structures and Algorithms · Computer Science
Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
Mohsen Ghaffari, Jaehyun Koo
2025-07-10
Data Structures and Algorithms · Computer Science
Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
Julia Chuzhoy, Merav Parter
2026-01-29
Machine Learning · Statistics
Sparse partial least squares for on-line variable selection in multivariate data streams
Brian McWilliams, Giovanni Montana
2009-02-10
Data Structures and Algorithms · Computer Science
On Fully Dynamic Graph Sparsifiers
Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger +1
2018-03-02
Physics and Society · Physics
Efficient reconstruction of transmission probabilities in a spreading process from partial observations
Andrey Y. Lokhov, Theodor Misiakiewicz
2015-09-24
Distributed, Parallel, and Cluster Computing · Computer Science
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen +1
2017-10-25
Optimization and Control · Mathematics
Distributed synchronous and asynchronous algorithms for semi-definite programming with diagonal constraints
Xia Jiang, Xianlin Zeng, Jian Sun, Jie Chen
2021-04-02
Optimization and Control · Mathematics
Centralized and distributed online learning for sparse time-varying optimization
Sophie M. Fosson
2020-02-03
Machine Learning · Statistics
Debiased distributed learning for sparse partial linear models in high dimensions
Shaogao Lv, Heng Lian
2019-11-05
Data Structures and Algorithms · Computer Science
Fully Dynamic Spanners with Worst-Case Update Time
Greg Bodwin, Sebastian Krinninger
2018-03-02
Data Structures and Algorithms · Computer Science
A Simple Dynamic Spanner via APSP
Rasmus Kyng, Simon Meierhans, Gernot Zöcklein
2024-08-22
Data Structures and Algorithms · Computer Science
Simple parallel and distributed algorithms for spectral graph sparsification
Ioannis Koutis
2014-04-21
Distributed, Parallel, and Cluster Computing · Computer Science
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
Sharareh Alipour, Ehsan Futuhi, Shayan Karimi
2021-01-05
Machine Learning · Statistics
Efficient Distributed Learning with Sparsity
Jialei Wang, Mladen Kolar, Nathan Srebro, Tong Zhang
2016-05-26
Data Structures and Algorithms · Computer Science
Fully Dynamic Spectral Sparsification for Directed Hypergraphs
Sebastian Forster, Gramoz Goranci, Ali Momeni
2026-01-12
Optimization and Control · Mathematics
An Online Parallel and Distributed Algorithm for Recursive Estimation of Sparse Signals
Yang Yang, Mengyi Zhang, Marius Pesavento, Daniel P. Palomar
2017-12-12
Optimization and Control · Mathematics
A Sparse Polytopic LPV Controller for Fully-Distributed Nonlinear Optimal Control
Sara Spedicato, Sarnavi Mahesh, Giuseppe Notarstefano
2020-01-29
Optimization and Control · Mathematics
A Proximal Diffusion Strategy for Multi-Agent Optimization with Sparse Affine Constraints
Sulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed
2019-12-12
Optimization and Control · Mathematics
On Distributed Exact Sparse Linear Regression over Networks
Tu Anh-Nguyen, César A. Uribe
2022-04-04