Distributed and Massively Parallel Graph Algorithms

Informazioni relative al progetto

DistMaP

ID dell’accordo di sovvenzione: 853109

DOI

10.3030/853109

Progetto concluso il 31 Ottobre 2024

Data della firma CE 7 Ottobre 2019

Data di avvio 1 Novembre 2019

Data di completamento 31 Ottobre 2024

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 498 250,00

Contributo UE

€ 1 498 250,00

Coordinato da

MAX-PLANCK-GESELLSCHAFT ZUR FORDERUNG DER WISSENSCHAFTEN EV
Germany

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (34)

Fully Dynamic Consistent <i>k</i>-Center Clustering

Autori: Jakub Łącki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhoň
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 3463-3484
Editore: ACM, Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.124

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

Autori: Vaclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler
Pubblicato in: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2023, Pagina/e 1114-1121
Editore: IEEE
DOI: 10.1109/focs54457.2022.00107

Massively Parallel Algorithms for Distance Approximation and Spanners

Autori: Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrović, Yasamin Nazari
Pubblicato in: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures, 2021
Editore: ACM

Undirected (1+ <i></i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms

Autori: Václav Rozhoň, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
Pubblicato in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2023, Pagina/e 478-487
Editore: ACM
DOI: 10.1145/3519935.3520074

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs

Autori: Michal Dory, Mohsen Ghaffari, Saeed Ilchi
Pubblicato in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, 2023, Pagina/e 292-300
Editore: ACM
DOI: 10.1145/3519270.3538437

Massively Parallel Algorithms for b-Matching

Autori: Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrović
Pubblicato in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2023, Pagina/e 35-44
Editore: ACM
DOI: 10.1145/3490148.3538589

Massively Parallel Algorithms for Distance Approximation and Spanners

Autori: Amartya Shankha Biswas; Michal Dory; Mohsen Ghaffari; Slobodan Mitrovic; Yasamin Nazari
Pubblicato in: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '21), 2021
Editore: SIAM
DOI: 10.1145/3409964.3461784

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics

Autori: Jan Grebík, Václav Rozhoň
Pubblicato in: Proceedings of the EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2021
Editore: AMUC

Hop-constrained oblivious routing

Autori: Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Pagina/e 1208-1220, ISBN 9781450380539
Editore: ACM
DOI: 10.1145/3406325.3451098

Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs

Autori: Manuela Fischer, Jeff Giliberti, Christoph Grunau
Pubblicato in: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Pagina/e 89-100
Editore: ACM
DOI: 10.1145/3558481.3591081

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Autori: Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhoň
Pubblicato in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2023, Pagina/e 1-10
Editore: ACM
DOI: 10.1145/3490148.3538565

A Time-Optimal Randomized Parallel Algorithm for MIS

Autori: Mohsen Ghaffari; Bernhard Haeupler
Pubblicato in: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '21), 2021
Editore: SIAM
DOI: 10.1137/1.9781611976465.172

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Autori: Václav Rozhoň, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Pubblicato in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Pagina/e 321-334
Editore: ACM
DOI: 10.1145/3564246.3585235

Strong-Diameter Network Decomposition

Autori: Yi-Jun Chang; Mohsen Ghaffari
Pubblicato in: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21), Numero 3, 2021
Editore: SIAM
DOI: 10.1145/3465084.3467933

The Landscape of Distributed Complexities on Trees and Beyond

Autori: Christoph Grunau, Václav Rozhoň, Sebastian Brandt
Pubblicato in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, 2023, Pagina/e 37-47
Editore: ACM
DOI: 10.1145/3519270.3538452

Polylogarithmic-time deterministic network decomposition and distributed derandomization

Autori: Václav Rozhoň, Mohsen Ghaffari
Pubblicato in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Pagina/e 350-363, ISBN 9781450369794
Editore: ACM
DOI: 10.1145/3357713.3384298

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics

Autori: Grebík, Jan; Rozhoň, Václav
Pubblicato in: European Conference on Combinatorics, Graph Theory and Applications 2021, 2021
Editore: Birkhauser Cham
DOI: 10.1007/978-3-030-83823-2

Improved Deterministic Network Decomposition

Autori: Mohsen Ghaffari, Christoph Grunau, Vaclav Rozhon
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Pagina/e 2904-2923
Editore: SIAM

Improved Deterministic Connectivity in Massively Parallel Computation

Autori: Fischer, Manuela; Giliberti, Jeff; Grunau, Christoph
Pubblicato in: 36th International Symposium on Distributed Computing (DISC 2022), Numero 18, 2022
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.3929/ethz-b-000579756

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma

Autori: Sebastian Brandt, Christoph Grunau, Václav Rozhoň
Pubblicato in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Pagina/e 329-338, ISBN 9781450375825
Editore: ACM
DOI: 10.1145/3382734.3405730

Strong-Diameter Network Decomposition

Autori: Chang, Yi-Jun; Ghaffari, Mohsen
Pubblicato in: Proceedings of the ACM Symposium on Principles of Distributed Computing, 2021
Editore: ACM

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Autori: Mohsen Ghaffari; Bernhard Haeupler
Pubblicato in: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21), 2021
Editore: SIAM
DOI: 10.1145/3465084.3467935

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Autori: Ghaffari, Mohsen; Haeupler, Bernhard
Pubblicato in: Proceedings of the ACM Symposium on Principles of Distributed Computing, 2021
Editore: ACM

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics

Autori: Brandt, Sebastian; Chang, Yi-Jun; Grebík, Jan; Grunau, Christoph; Rozhoň, Václav; Vidnyánszky, Zoltán
Pubblicato in: Innovations of Theoretical Computer Science (ITCS) 2022, 2022
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2022.29

The randomized local computation complexity of the Lov\'asz local lemma

Autori: Brandt, Sebastian; Grunau, Christoph; Rozhoň, Václav
Pubblicato in: Principles of Distributed Computing (PODC) 2021, 2021
Editore: SIAM
DOI: 10.1145/3465084.3467931

Massively Parallel Algorithms for Minimum Cut

Autori: Mohsen Ghaffari, Krzysztof Nowicki
Pubblicato in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Pagina/e 119-128, ISBN 9781450375825
Editore: ACM
DOI: 10.1145/3382734.3405737

Distributed MIS with Low Energy and Time Complexities

Autori: Mohsen Ghaffari, Julian Portmann
Pubblicato in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2024, Pagina/e 146-156
Editore: ACM
DOI: 10.1145/3583668.3594587

Improved Deterministic Network Decomposition

Autori: Ghaffari, Mohsen; Grunau, Christoph; Rozhoň, Václav
Pubblicato in: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '21), 2021
Editore: SIAM
DOI: 10.1137/1.9781611976465.173

k-means++: few more steps yield constant approximation

Autori: Davin Choo, Christoph Grunau, Julian Portmann, Vaclav Rozhon
Pubblicato in: Proceedings of the 37th International Conference on Machine Learning, 2020, Pagina/e 1909-1917
Editore: PMLR

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond

Autori: Mohsen Ghaffari, Christoph Grunau, Ce Jin
Pubblicato in: Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020), 2020, Pagina/e 34:1--34:18
Editore: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2020.34

Simple and sharp analysis of k-means||

Autori: Rozhoň, Václav
Pubblicato in: Proceedings of the 37th International Conference on Machine Learning, 2020, Pagina/e 8266-8275
Editore: PMLR

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS

Autori: Mohsen Ghaffari, Christoph Grunau
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 2148-2179
Editore: IEEE
DOI: 10.1109/focs61266.2024.00007

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps

Autori: Bernhard Haeupler, Richard Hladík, Václav Rozhoň, Robert E. Tarjan, Jakub Tetĕk
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 2099-2130
Editore: IEEE
DOI: 10.1109/focs61266.2024.00125

A Massively Parallel Algorithm for Minimum Weight Vertex Cover

Autori: Mohsen Ghaffari, Ce Jin, Daan Nilis
Pubblicato in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, Pagina/e 259-268, ISBN 9781450369350
Editore: ACM
DOI: 10.1145/3350755.3400260

Peer reviewed articles (1)

Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics

Autori: Jan Grebík, Václav Rozhoň
Pubblicato in: Advances in Mathematics, Numero 431, 2024, Pagina/e 109241, ISSN 0001-8708
Editore: Academic Press
DOI: 10.1016/j.aim.2023.109241

Book chapters (4)

A Simple Deterministic Distributed Low-Diameter Clustering

Autori: Václav Rozho, Bernhard Haeupler, Christoph Grunau
Pubblicato in: Symposium on Simplicity in Algorithms (SOSA), 2023, Pagina/e 166-174
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977585.ch16

Network Decomposition and Distributed Derandomization (Invited Paper)

Autori: Mohsen Ghaffari
Pubblicato in: Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29–July 1, 2020, Proceedings, Numero 12156, 2020, Pagina/e 3-18, ISBN 978-3-030-54920-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-54921-3_1

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond

Autori: Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhoň
Pubblicato in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Pagina/e 4409-4447
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch168

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization

Autori: Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhoň
Pubblicato in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Pagina/e 2532-2566
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch97