Image de couverture de livre

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bonamy, Marthe, Gavoille, Cyril, Picavet, Timothé, Wesolek, Alexandra
Format:	Preprint
Publié:	2025
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Meta-Theorems for Cuttable Distributed Problems
par: Bonamy, Marthe, et autres
Publié: (2026)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
par: Bonamy, Marthe, et autres
Publié: (2025)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
par: Gil, Yuval
Publié: (2024)

Local Density and its Distributed Approximation
par: Christiansen, Aleksander Bjørn, et autres
Publié: (2024)

Distributed Graph Algorithms with Predictions
par: Boyar, Joan, et autres
Publié: (2025)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
par: Manoharan, Vignesh, et autres
Publié: (2023)

On Distributed Computation of the Minimum Triangle Edge Transversal
par: Censor-Hillel, Keren, et autres
Publié: (2024)

The Local Information Cost of Distributed Graph Spanners
par: Robinson, Peter
Publié: (2020)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
par: Baumecker, Malte, et autres
Publié: (2025)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
par: Sanders, Peter, et autres
Publié: (2024)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
par: Chang, Yen-Hsiang, et autres
Publié: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
par: Lenzen, Christoph, et autres
Publié: (2024)

Distributed Reductions for the Maximum Weight Independent Set Problem
par: Borowitz, Jannick, et autres
Publié: (2025)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

PASGAL: Parallel And Scalable Graph Algorithm Library
par: Dong, Xiaojun, et autres
Publié: (2024)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
par: Assadi, Sepehr
Publié: (2023)

Distributed Download from an External Data Source in Faulty Majority Settings
par: Augustine, John, et autres
Publié: (2024)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

Congested Clique Counting for Local Gibbs Distributions
par: Sobel, Joshua Z.
Publié: (2025)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
par: Boneh, Itai, et autres
Publié: (2025)

On the Randomized Locality of Matching Problems in Regular Graphs
par: Khoury, Seri, et autres
Publié: (2025)

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
par: Flin, Maxime, et autres
Publié: (2024)

Distributed Lovász Local Lemma under Bandwidth Limitations
par: Halldórsson, Magnús M., et autres
Publié: (2024)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
par: Chang, Yi-Jun
Publié: (2023)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
par: Li, Qian, et autres
Publié: (2024)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
par: Chang, Yi-Jun, et autres
Publié: (2026)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
par: Faour, Salwa, et autres
Publié: (2025)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
par: Hsieh, Chou-Ying, et autres
Publié: (2024)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
par: Mordacchini, Matteo, et autres
Publié: (2025)

Invitation to Local Algorithms
par: Rozhoň, Václav
Publié: (2024)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Massively Parallel Ruling Set Made Deterministic
par: Giliberti, Jeff, et autres
Publié: (2024)

Parallel Batch-Dynamic Maximal Independent Set
par: Blelloch, Guy, et autres
Publié: (2026)

An Implementation and Experimental Comparison of Dynamic Ordered Sets
par: Malek, Jordan
Publié: (2024)

Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
par: Raulet, Gabriel, et autres
Publié: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
par: Bui, Hong Duc, et autres
Publié: (2024)

Energy-Efficient Maximal Independent Sets in Radio Networks
par: Banasik, Dominick, et autres
Publié: (2025)

DAG-Inducing Problems and Algorithms
par: Gupta, Arya Tanmay, et autres
Publié: (2023)