scientific article; zbMATH DE number 7559144
From MaRDI portal
Publication:5090485
DOI10.4230/LIPIcs.STACS.2019.35MaRDI QIDQ5090485
Niklas Hjuler, Nikos Parotsidis, David Saulpic, Giuseppe F. Italiano
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.09877
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected dominating set. Theory and applications
- Connected dominating sets on dynamic geometric graphs
- Approximation algorithms for connected dominating sets
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A data structure for dynamic trees
- A threshold of ln n for approximating set cover
- Strong lower bounds on the approximability of some NPO PB-complete maximization problems
- A Greedy Heuristic for the Set-Covering Problem
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
- Faster Fully Dynamic Matchings with Small Approximation Ratios
- Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
- Online and dynamic algorithms for set cover
- An efficient distributed algorithm for constructing small dominating sets
- Fully dynamic maximal independent set with sublinear update time
- A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
- Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
- A new approach to dynamic all pairs shortest paths
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Constant-time distributed dominating set approximation
This page was built for publication:
