Imagen de Portada

Fully Scalable MPC Algorithms for Euclidean k-Center

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Czumaj, Artur, Gao, Guichen, Ghaffari, Mohsen, Jiang, Shaofeng H. -C.
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Parallel Dynamic Maximal Matching
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

A Cut-Matching Game for Constant-Hop Expanders
por: Haeupler, Bernhard, et al.
Publicado: (2022)

Fast Broadcast in Highly Connected Networks
por: Chandra, Shashwat, et al.
Publicado: (2024)

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

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
por: De Man, Quinten, et al.
Publicado: (2025)

PASGAL: Parallel And Scalable Graph Algorithm Library
por: Dong, Xiaojun, et al.
Publicado: (2024)

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

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
por: Liu, Quanquan C., et al.
Publicado: (2024)

Parallel $k$-Core Decomposition: Theory and Practice
por: Liu, Youzhe, et al.
Publicado: (2025)

Efficient Enumeration of Large Maximal k-Plexes
por: Cheng, Qihao, et al.
Publicado: (2024)

Scalable Fault-Tolerant MapReduce
por: Hespe, Demian, et al.
Publicado: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
por: Wan, Zijin, et al.
Publicado: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
por: Carmel, Amir, et al.
Publicado: (2026)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
por: Robinson, Peter, et al.
Publicado: (2025)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
por: Wu, Hanjiang, et al.
Publicado: (2024)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
por: Shovan, S. M., et al.
Publicado: (2025)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
por: Chakraborty, Srijan, et al.
Publicado: (2025)

Distributed Graph Algorithms with Predictions
por: Boyar, Joan, et al.
Publicado: (2025)

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

DAG-Inducing Problems and Algorithms
por: Gupta, Arya Tanmay, et al.
Publicado: (2023)

Eventually Lattice-Linear Algorithms
por: Gupta, Arya Tanmay, et al.
Publicado: (2023)

Setchain Algorithms for Blockchain Scalability
por: Karmegam, Arivarasan, et al.
Publicado: (2025)

Encoding Schemes for Parallel In-Place Algorithms
por: Hutton, Chase, et al.
Publicado: (2025)

Parallel Algorithms for Hierarchical Nucleus Decomposition
por: Shi, Jessica, et al.
Publicado: (2023)

Massively Parallel Algorithms for Approximate Shortest Paths
por: Dory, Michal, et al.
Publicado: (2024)

Designing Parallel Algorithms for Community Detection using Arachne
por: Li, Fuhuan, et al.
Publicado: (2025)

Parallel Algorithms for the One Sided Crossing Minimization Problem
por: Popa, Bogdan-Ioan, et al.
Publicado: (2025)

Two Efficient Message-passing Exclusive Scan Algorithms
por: Träff, Jesper Larsson
Publicado: (2026)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
por: Wang, Letong, et al.
Publicado: (2023)

A Parallel Scan Algorithm in the Tensor Core Unit Model
por: Zouzias, Anastasios, et al.
Publicado: (2024)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
por: Fokkink, Wan, et al.
Publicado: (2026)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

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

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
por: Li, Qian, et al.
Publicado: (2024)