Cover Image

Distributed Santa Claus via Global Rounding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	de Vos, Tijn, Wennmann, Leo, Baumecker, Malte, Maus, Yannic, Schager, Florian
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

On the Locality of Hall's Theorem
by: Brandt, Sebastian, et al.
Published: (2025)

Towards Optimal Distributed Delta Coloring
by: Jakob, Manuel, et al.
Published: (2025)

Distributed Delta-Coloring under Bandwidth Limitations
by: Maus, Yannic, et al.
Published: (2024)

Distributed Lovász Local Lemma under Bandwidth Limitations
by: Halldórsson, Magnús M., et al.
Published: (2024)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
by: Flin, Maxime, et al.
Published: (2026)

Adaptive Massively Parallel Coloring in Sparse Graphs
by: Latypov, Rustam, et al.
Published: (2024)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)

Round-Delayed Amnesiac Flooding
by: Alafin, Oluwatobi, et al.
Published: (2026)

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

Sorting in One and Two Rounds using $t$-Comparators
by: Gelles, Ran, et al.
Published: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
by: Liu, Quanquan C., et al.
Published: (2024)

What Can We Compute in a Single Round of the Congested Clique?
by: Robinson, Peter
Published: (2022)

Distributed Triangle Detection is Hard in Few Rounds
by: Assadi, Sepehr, et al.
Published: (2025)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
by: Lenzen, Christoph, et al.
Published: (2024)

A Distributed Conductance Tester Without Global Information Collection
by: Batu, Tugkan, et al.
Published: (2023)

Global certification via perfect hashing
by: Bousquet, Nicolas, et al.
Published: (2024)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
by: Bourreau, Yann, et al.
Published: (2025)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
by: Bourreau, Yann, et al.
Published: (2025)

Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)

Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)

Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)

Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)

Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)

Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)

Distributed Subgraph Finding: Progress and Challenges
by: Censor-Hillel, Keren
Published: (2022)

Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)

$k$-Center Clustering in Distributed Models
by: Biabani, Leyla, et al.
Published: (2024)

A Simple Distributed Deterministic Planar Separator
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)

On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)

Congested Clique Counting for Local Gibbs Distributions
by: Sobel, Joshua Z.
Published: (2025)

The Local Information Cost of Distributed Graph Spanners
by: Robinson, Peter
Published: (2020)

A Simple and Robust Protocol for Distributed Counting
by: Cohen, Edith, et al.
Published: (2025)

Fully-Distributed Byzantine Agreement in Sparse Networks
by: Augustine, John, et al.
Published: (2024)

Distributed Interactive Proofs for Planarity with Log-Star Communication
by: Gil, Yuval, et al.
Published: (2025)

Distributed Reductions for the Maximum Weight Independent Set Problem
by: Borowitz, Jannick, et al.
Published: (2025)

Breaking Barriers for Distributed MIS by Faster Degree Reduction
by: Khoury, Seri, et al.
Published: (2025)

Tight Bounds on the Message Complexity of Distributed Tree Verification
by: Kutten, Shay, et al.
Published: (2024)