Towards a New Theory of Optimal Dynamic Graph Algorithms

Información del proyecto

DynOpt

Identificador del acuerdo de subvención: 101043159

DOI

10.3030/101043159

Fecha de la firma de la CE 16 Febrero 2022

Fecha de inicio 1 Octubre 2022

Fecha de finalización 30 Septiembre 2027

Financiado con arreglo a

• European Research Council (ERC)

Coste total

€ 1 400 000,00

Aportación de la UE

€ 1 400 000,00

Coordinado por

TEL AVIV UNIVERSITY
Israel

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Conference proceedings (11)

A Lossless Deamortization for Dynamic Greedy Set Cover

Autores: Shay Solomon, Amitai Uzrad, Tianyi Zhang
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Editor: IEEE
DOI: 10.1109/FOCS61266.2024.00025

Arboricity-Dependent Algorithms for Edge Coloring

Autores: Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
Publicado en: Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), 2024
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.SWAT.2024.12

Faster $(\Delta+1)$-Edge Coloring: Breaking the $m\sqrt{n}$ Time Barrier

Autores: Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Editor: IEEE
DOI: 10.1109/FOCS61266.2024.00128

A Unified Framework for Light Spanners

Autores: Le, Hung; Solomon, Shay
Publicado en: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Editor: Association for Computing Machinery
DOI: 10.48550/arxiv.2008.10582

Covering Planar Metrics (and Beyond): O(1) Trees Suffice

Autores: Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Editor: IEEE
DOI: 10.1109/FOCS57990.2023.00139

Optimal Euclidean Tree Covers

Autores: Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, Cuong Than
Publicado en: Proceedings of the 40th International Symposium on Computational Geometry (SoCG 2024), 2024
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.SOCG.2024.37

Towards Instance-Optimal Euclidean Spanners

Autores: Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Editor: IEEE
DOI: 10.1109/FOCS61266.2024.00099

Dynamic ((1+) ln )-Approximation Algorithms for Minimum Set Cover and Dominating Set

Autores: Shay Solomon, Amitai Uzrad
Publicado en: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Editor: ACM
DOI: 10.1145/3564246.3585211

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier

Autores: Hung Le, Shay Solomon, Cuong Than
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Editor: IEEE
DOI: 10.1109/FOCS57990.2023.00013

Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function

Autores: Le, Hung; Milenković, Lazar; Solomon, Shay
Publicado en: Proceedings of the 39th International Symposium on Computational Geometry, SoCG 2023, 2023
Editor: Schloss Dagstuhl–Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.SOCG.2023.47

Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring

Autores: Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
Publicado en: 2024
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.ESA.2024.23

Book chapters (4)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More

Autores: Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, Cuong Than
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.191

Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time

Autores: Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.122

Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains

Autores: Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.167

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-<i>f</i> Time Barrier

Autores: Anton Bukov, Shay Solomon, Tianyi Zhang
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.24