Image de couverture de livre

Massively Parallel Minimum Spanning Tree in General Metric Spaces

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Azarmehr, Amir, Behnezhad, Soheil, Jayaram, Rajesh, Łącki, Jakub, Mirrokni, Vahab, Zhong, Peilin
Format:	Preprint
Publié:	2024
Sujets:	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

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
par: Azarmehr, Amir, et autres
Publié: (2024)

Single-Pass Streaming CSPs via Two-Tier Sampling
par: Azarmehr, Amir, et autres
Publié: (2026)

Stochastic Matching via In-n-Out Local Computation Algorithms
par: Azarmehr, Amir, et autres
Publié: (2024)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
par: Azarmehr, Amir, et autres
Publié: (2025)

Half-Approximating Maximum Dicut in the Streaming Setting
par: Azarmehr, Amir, et autres
Publié: (2025)

Lower Bounds for Non-adaptive Local Computation Algorithms
par: Azarmehr, Amir, et autres
Publié: (2025)

Markov Chains with Rewinding
par: Azarmehr, Amir, et autres
Publié: (2026)

Dynamic PageRank: Algorithms and Lower Bounds
par: Jayaram, Rajesh, et autres
Publié: (2024)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
par: Gottesbüren, Lars, et autres
Publié: (2024)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
par: Dhulipala, Laxman, et autres
Publié: (2024)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
par: Dhulipala, Laxman, et autres
Publié: (2023)

High-Dimensional Geometric Streaming for Nearly Low Rank Data
par: Esfandiari, Hossein, et autres
Publié: (2024)

Optimal Communication for Classic Functions in the Coordinator Model and Beyond
par: Esfandiari, Hossein, et autres
Publié: (2024)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
par: Behnezhad, Soheil, et autres
Publié: (2024)

Approximating Maximum Matching Requires Almost Quadratic Time
par: Behnezhad, Soheil, et autres
Publié: (2024)

Fully Dynamic (Δ+1) Coloring Against Adaptive Adversaries
par: Behnezhad, Soheil, et autres
Publié: (2024)

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
par: Ene, Alina, et autres
Publié: (2025)

Efficient Centroid-Linkage Clustering
par: Bateni, MohammadHossein, et autres
Publié: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
par: Hladík, Richard, et autres
Publié: (2024)

SubGen: Token Generation in Sublinear Time and Memory
par: Zandieh, Amir, et autres
Publié: (2024)

Sublinear Algorithms for TSP via Path Covers
par: Behnezhad, Soheil, et autres
Publié: (2023)

PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses
par: Javanmard, Adel, et autres
Publié: (2024)

Simple Length-Constrained Minimum Spanning Trees
par: Hershkowitz, D Ellis, et autres
Publié: (2024)

Planar Length-Constrained Minimum Spanning Trees
par: Hershkowitz, D Ellis, et autres
Publié: (2025)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
par: Bateni, MohammadHossein, et autres
Publié: (2025)

Stochastic Minimum Spanning Trees with a Single Sample
par: Hoeksma, Ruben, et autres
Publié: (2024)

Correlation Clustering Beyond the Pivot Algorithm
par: Behnezhad, Soheil, et autres
Publié: (2024)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

Spanning and Metric Tree Covers Parameterized by Treewidth
par: Elkin, Michael, et autres
Publié: (2025)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
par: Zandieh, Amir, et autres
Publié: (2025)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
par: Epasto, Alessandro, et autres
Publié: (2020)

Vizing's Theorem in Near-Linear Time
par: Assadi, Sepehr, et autres
Publié: (2024)

Vizing's Theorem in Deterministic Almost-Linear Time
par: Assadi, Sepehr, et autres
Publié: (2025)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
par: Ding, Xiangyun, et autres
Publié: (2025)

Data-Dependent LSH for the Earth Mover's Distance
par: Jayaram, Rajesh, et autres
Publié: (2024)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
par: Yu, Shangdi, et autres
Publié: (2025)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
par: Goldenfeld, Michael Elkin Tanya
Publié: (2026)

Streaming Algorithms with Few State Changes
par: Jayaram, Rajesh, et autres
Publié: (2024)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
par: Karamchedu, Mithra, et autres
Publié: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)