Image de couverture de livre

Massively Parallel Maximum Coverage Revisited

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bui, Thai, Vu, Hoa T.
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Adaptive Massively Parallel Coloring in Sparse Graphs
par: Latypov, Rustam, et autres
Publié: (2024)

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

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
par: Liu, Quanquan C., et autres
Publié: (2024)

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

Parallel Dynamic Maximal Matching
par: Ghaffari, Mohsen, et autres
Publié: (2024)

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

Parallel Integer Sort: Theory and Practice
par: Dong, Xiaojun, et autres
Publié: (2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition
par: Shi, Jessica, et autres
Publié: (2023)

Parallel Scan on Ascend AI Accelerators
par: Wróblewski, Bartłomiej, et autres
Publié: (2025)

Encoding Schemes for Parallel In-Place Algorithms
par: Hutton, Chase, et autres
Publié: (2025)

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
par: Wan, Zijin, et autres
Publié: (2024)

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

Parallel and (Nearly) Work-Efficient Dynamic Programming
par: Ding, Xiangyun, et autres
Publié: (2024)

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

Parallel $k$-Core Decomposition: Theory and Practice
par: Liu, Youzhe, et autres
Publié: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

Parallel Algorithms for the One Sided Crossing Minimization Problem
par: Popa, Bogdan-Ioan, et autres
Publié: (2025)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
par: Karmegam, Arivarasan, et autres
Publié: (2026)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
par: De Man, Quinten, et autres
Publié: (2025)

Parallel Point-to-Point Shortest Paths and Batch Queries
par: Dong, Xiaojun, et autres
Publié: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
par: Wang, Letong, et autres
Publié: (2023)

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

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
par: Yang, Mingqi
Publié: (2024)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
par: Liu, Quanquan C., et autres
Publié: (2024)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
par: Wu, Hanjiang, et autres
Publié: (2024)

A Parallel Scan Algorithm in the Tensor Core Unit Model
par: Zouzias, Anastasios, et autres
Publié: (2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
par: Dhulipala, Laxman, et autres
Publié: (2024)

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

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

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
par: Dhulipala, Laxman, et autres
Publié: (2024)

Parallel Joinable B-Trees in the Fork-Join I/O Model
par: Goodrich, Michael, et autres
Publié: (2025)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
par: Blelloch, Guy E., et autres
Publié: (2025)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
par: Garg, Vijay K., et autres
Publié: (2026)

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

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
par: Dindoost, Mohammad, et autres
Publié: (2025)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
par: Ashvinkumar, Vikrant, et autres
Publié: (2023)