Fast Algorithms for a Reactive Network Layer

Project Period: 2023-03-01 – 2024-09-30
Externally Funded
Principal Investigator
Monika H Henzinger
Grant Number
P33775
Funding Organisation
FWF

11 Publications

2024 | Conference Paper | IST-REx-ID: 15008 | OA
Electrical flows for polylogarithmic competitive oblivious routing
G. Goranci, M.H. Henzinger, H. Räcke, S. Sachdeva, A.R. Sricharan, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | arXiv
 
2024 | Conference Paper | IST-REx-ID: 14769 | OA
Experimental evaluation of fully dynamic k-means via coresets
M.H. Henzinger, D. Saulpic, L. Sidl, in:, 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial & Applied Mathematics, 2024, pp. 220–233.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Journal Article | IST-REx-ID: 15121 | OA
Multiplicative auction algorithm for approximate maximum weight bipartite matching
D.W. Zheng, M.H. Henzinger, Mathematical Programming (2024).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2024 | Conference Paper | IST-REx-ID: 15093 | OA
Dynamically maintaining the persistent homology of time series
S. Cultrera di Montesano, H. Edelsbrunner, M.H. Henzinger, L. Ost, in:, D.P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, 2024, pp. 243–295.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2024 | Conference Paper | IST-REx-ID: 15253 | OA
A unifying framework for differentially private sums under continual observation
M.H. Henzinger, J. Upadhyay, S. Upadhyay, in:, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2023 | Conference Paper | IST-REx-ID: 14085 | OA
Efficient data structures for incremental exact and approximate maximum flow
G. Goranci, M.H. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version] View | Files available | DOI
 
2023 | Conference Paper | IST-REx-ID: 14086 | OA
Faster submodular maximization for several classes of matroids
M.H. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version] View | Files available | DOI | arXiv
 
2023 | Conference Paper | IST-REx-ID: 14462 | OA
Constant matters: Fine-grained error bound on differentially private continual observation
H. Fichtenberger, M.H. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.
[Published Version] View | Download Published Version (ext.)
 
2023 | Journal Article | IST-REx-ID: 14558
Deterministic near-optimal approximation algorithms for dynamic set cover
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, SIAM Journal on Computing 52 (2023) 1132–1192.
View | DOI
 
2023 | Journal Article | IST-REx-ID: 14043 | OA
A combinatorial cut-toggling algorithm for solving Laplacian linear systems
M.H. Henzinger, B. Jin, R. Peng, D.P. Williamson, Algorithmica 85 (2023) 2680–3716.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2023 | Conference Paper | IST-REx-ID: 13236 | OA
Multiplicative auction algorithm for approximate maximum weight bipartite matching
D.W. Zheng, M.H. Henzinger, in:, International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2023, pp. 453–465.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv