MGMaximilian Probst Gutenberg
Maximilian Probst Gutenberg
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Maximilian Probst Gutenberg has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Rasmus Kyng
ETH Zurich ETH Zurich ETH Zurich
4 shared publications - Simon Meierhans
ETH Zurich ETH Zurich ETH Zurich
3 shared publications - Amir Abboud
Weizmann Institute of Science
1 shared publication Christian Wulff-Nilsen
Department of Computer Science Basic Algorithms Research Copenhagen (BARC) BARC) University of Copenhagen Algorithms Research Copenhagen ( Denmark
1 shared publication- Debarati Das
Pennsylvania State University United States
1 shared publication - Debmalya Panigrahi
Duke University, Durham, USA
1 shared publication
Latest Publications
- Open Access
Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
We present a new and surprisingly simple analysis of random-shift decompositions -- originally proposed by Miller, Peng, and Xu [SPAA'13]: We show that decompositions for exponentially growing scales $D = 2^0, 2^1, \ldots, 2^{\log_2(\operatorname{diam}(G))}$, have a tight constant trade-off between distance-to-center and separation probability on average across the distance scales -- opposed to a necessary $Ω(\log n)$ trade-off for a single scale. This almost immediately yields a way to compute a tree $T$ for graph $G$ that preserves all graph distances with expected $O(\log n)$-stretch. This gives an alternative proof that obtains tight approximation bounds of the seminal result by Fakcharoenphol, Rao, and Talwar [STOC'03] matching the $Ω(\log n)$ lower bound by Bartal [FOCS'96]. Our insights can also be used to refine the analysis of a simple $\ell_1$-oblivious routing proposed in [FOCS'22], yielding a tight $O(\log n)$ competitive ratio. Our algorithms for constructing tree embeddings and $\ell_1$-oblivious routings can be implemented in the sequential, parallel, and distributed settings with optimal work, depth, and rounds, up to polylogarithmic factors. Previously, fast algorithms with tight guarantees were not known for tree embeddings in parallel and distributed settings, and for $\ell_1$-oblivious routings, not even a fast sequential algorithm was known.Open AccessRandom-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
We present a new and surprisingly simple analysis of random-shift decompositions -- originally proposed by Miller, Peng, and Xu [SPAA'13]: We show that decompositions for exponentially growing scales $D = 2^0, 2^1, \ldots, 2^{\log_2(\operatorname{diam}(G))}$, have a tight constant trade-off between distance-to-center and separation probability on average across the distance scales -- opposed to a necessary $Ω(\log n)$ trade-off for a single scale. This almost immediately yields a way to compute a tree $T$ for graph $G$ that preserves all graph distances with expected $O(\log n)$-stretch. This gives an alternative proof that obtains tight approximation bounds of the seminal result by Fakcharoenphol, Rao, and Talwar [STOC'03] matching the $Ω(\log n)$ lower bound by Bartal [FOCS'96]. Our insights can also be used to refine the analysis of a simple $\ell_1$-oblivious routing proposed in [FOCS'22], yielding a tight $O(\log n)$ competitive ratio. Our algorithms for constructing tree embeddings and $\ell_1$-oblivious routings can be implemented in the sequential, parallel, and distributed settings with optimal work, depth, and rounds, up to polylogarithmic factors. Previously, fast algorithms with tight guarantees were not known for tree embeddings in parallel and distributed settings, and for $\ell_1$-oblivious routings, not even a fast sequential algorithm was known. - Open Access
Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
Whether a graph $G=(V,E)$ is connected is arguably its most fundamental property. Naturally, connectivity was the first characteristic studied for dynamic graphs, i.e. graphs that undergo edge insertions and deletions. While connectivity algorithms with polylogarithmic amortized update time have been known since the 90s, achieving worst-case guarantees has proven more elusive. Two recent breakthroughs have made important progress on this question: (1) Kapron, King and Mountjoy [SODA'13; Best Paper] gave a Monte-Carlo algorithm with polylogarithmic worst-case update time, and (2) Nanongkai, Saranurak and Wulff-Nilsen [STOC'17, FOCS'17] obtained a Las-Vegas data structure, however, with subpolynomial worst-case update time. Their algorithm was subsequently de-randomized [FOCS'20]. In this article, we present a new dynamic connectivity algorithm based on the popular core graph framework that maintains a hierarchy interleaving vertex and edge sparsification. Previous dynamic implementations of the core graph framework required subpolynomial update time. In contrast, we show how to implement it for dynamic connectivity with polylogarithmic expected worst-case update time. We further show that the algorithm can be de-randomized efficiently: a deterministic static algorithm for computing a connectivity edge-sparsifier of low congestion in time $T(m) \cdot m$ on an $m$-edge graph yields a deterministic dynamic connectivity algorithm with $\tilde{O}(T(m))$ worst-case update time. Via current state-of-the-art algorithms [STOC'24], we obtain $T(m) = m^{o(1)}$ and recover deterministic subpolynomial worst-case update time.Open AccessDynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
Whether a graph $G=(V,E)$ is connected is arguably its most fundamental property. Naturally, connectivity was the first characteristic studied for dynamic graphs, i.e. graphs that undergo edge insertions and deletions. While connectivity algorithms with polylogarithmic amortized update time have been known since the 90s, achieving worst-case guarantees has proven more elusive. Two recent breakthroughs have made important progress on this question: (1) Kapron, King and Mountjoy [SODA'13; Best Paper] gave a Monte-Carlo algorithm with polylogarithmic worst-case update time, and (2) Nanongkai, Saranurak and Wulff-Nilsen [STOC'17, FOCS'17] obtained a Las-Vegas data structure, however, with subpolynomial worst-case update time. Their algorithm was subsequently de-randomized [FOCS'20]. In this article, we present a new dynamic connectivity algorithm based on the popular core graph framework that maintains a hierarchy interleaving vertex and edge sparsification. Previous dynamic implementations of the core graph framework required subpolynomial update time. In contrast, we show how to implement it for dynamic connectivity with polylogarithmic expected worst-case update time. We further show that the algorithm can be de-randomized efficiently: a deterministic static algorithm for computing a connectivity edge-sparsifier of low congestion in time $T(m) \cdot m$ on an $m$-edge graph yields a deterministic dynamic connectivity algorithm with $\tilde{O}(T(m))$ worst-case update time. Via current state-of-the-art algorithms [STOC'24], we obtain $T(m) = m^{o(1)}$ and recover deterministic subpolynomial worst-case update time. - Open Access
Deterministic Almost-Linear-Time Gomory-Hu Trees
Given an $m$-edge, undirected, weighted graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree over the vertex set $V$ such that all-pairs mincuts in $G$ are preserved exactly in $T$. In this article, we give the first almost-optimal $m^{1+o(1)}$-time deterministic algorithm for constructing a Gomory-Hu tree. Prior to our work, the best deterministic algorithm for this problem dated back to the original algorithm of Gomory and Hu that runs in $nm^{1+o(1)}$ time (using current maxflow algorithms). In fact, this is the first almost-linear time deterministic algorithm for even simpler problems, such as finding the $k$-edge-connected components of a graph. Our new result hinges on two separate and novel components that each introduce a distinct set of de-randomization tools of independent interest: - a deterministic reduction from the all-pairs mincuts problem to the single-souce mincuts problem incurring only subpolynomial overhead, and - a deterministic almost-linear time algorithm for the single-source mincuts problem.Open AccessDeterministic Almost-Linear-Time Gomory-Hu Trees
Given an $m$-edge, undirected, weighted graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree over the vertex set $V$ such that all-pairs mincuts in $G$ are preserved exactly in $T$. In this article, we give the first almost-optimal $m^{1+o(1)}$-time deterministic algorithm for constructing a Gomory-Hu tree. Prior to our work, the best deterministic algorithm for this problem dated back to the original algorithm of Gomory and Hu that runs in $nm^{1+o(1)}$ time (using current maxflow algorithms). In fact, this is the first almost-linear time deterministic algorithm for even simpler problems, such as finding the $k$-edge-connected components of a graph. Our new result hinges on two separate and novel components that each introduce a distinct set of de-randomization tools of independent interest: - a deterministic reduction from the all-pairs mincuts problem to the single-souce mincuts problem incurring only subpolynomial overhead, and - a deterministic almost-linear time algorithm for the single-source mincuts problem. - Open Access
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and cost increases. This implies almost-linear time algorithms for approximating the minimum-cost flow value and $s$-$t$ distance on such decremental graphs. Our framework additionally allows us to maintain decremental strongly connected components in almost-linear time deterministically. These algorithms also improve over the current best known runtimes for statically computing minimum-cost flow, in both the randomized and deterministic settings. We obtain our algorithms by taking the dual perspective, which yields cut-based algorithms. More precisely, our algorithm computes the flow via a sequence of $m^{1+o(1)}$ dynamic min-ratio cut problems, the dual analog of the dynamic min-ratio cycle problem that underlies recent fast algorithms for minimum-cost flow. Our main technical contribution is a new data structure that returns an approximately optimal min-ratio cut in amortized $m^{o(1)}$ time by maintaining a tree-cut sparsifier. This is achieved by devising a new algorithm to maintain the dynamic expander hierarchy of [Goranci-Räcke-Saranurak-Tan, SODA 2021] that also works in capacitated graphs. All our algorithms are deterministc, though they can be sped up further using randomized techniques while still working against an adaptive adversary.Open AccessAlmost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and cost increases. This implies almost-linear time algorithms for approximating the minimum-cost flow value and $s$-$t$ distance on such decremental graphs. Our framework additionally allows us to maintain decremental strongly connected components in almost-linear time deterministically. These algorithms also improve over the current best known runtimes for statically computing minimum-cost flow, in both the randomized and deterministic settings. We obtain our algorithms by taking the dual perspective, which yields cut-based algorithms. More precisely, our algorithm computes the flow via a sequence of $m^{1+o(1)}$ dynamic min-ratio cut problems, the dual analog of the dynamic min-ratio cycle problem that underlies recent fast algorithms for minimum-cost flow. Our main technical contribution is a new data structure that returns an approximately optimal min-ratio cut in amortized $m^{o(1)}$ time by maintaining a tree-cut sparsifier. This is achieved by devising a new algorithm to maintain the dynamic expander hierarchy of [Goranci-Räcke-Saranurak-Tan, SODA 2021] that also works in capacitated graphs. All our algorithms are deterministc, though they can be sped up further using randomized techniques while still working against an adaptive adversary. - Open Access
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications
We present a general toolbox, based on new vertex sparsifiers, for designing data structures to maintain shortest paths in dynamic graphs. In an $m$-edge graph undergoing edge insertions and deletions, our data structures give the first algorithms for maintaining (a) $m^{o(1)}$-approximate all-pairs shortest paths (APSP) with \emph{worst-case} update time $m^{o(1)}$ and query time $\tilde{O}(1)$, and (b) a tree $T$ that has diameter no larger than a subpolynomial factor times the diameter of the underlying graph, where each update is handled in amortized subpolynomial time. In graphs undergoing only edge deletions, we develop a simpler and more efficient data structure to maintain a $(1+ε)$-approximate single-source shortest paths (SSSP) tree $T$ in a graph undergoing edge deletions in amortized time $m^{o(1)}$ per update. Our data structures are deterministic. The trees we can maintain are not subgraphs of $G$, but embed with small edge congestion into $G$. This is in stark contrast to previous approaches and is useful for algorithms that internally use trees to route flow. To illustrate the power of our new toolbox, we show that our SSSP data structure gives simple deterministic implementations of flow-routing MWU methods in several contexts, where previously only randomized methods had been known. To obtain our toolbox, we give the first algorithm that, given a graph $G$ undergoing edge insertions and deletions and a dynamic terminal set $A$, maintains a vertex sparsifier $H$ that approximately preserves distances between terminals in $A$, consists of at most $|A|m^{o(1)}$ vertices and edges, and can be updated in worst-case time $m^{o(1)}$. Crucially, our vertex sparsifier construction allows us to maintain a low edge-congestion embedding of $H$ into $G$, which is needed for our applications.Open AccessA Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications
We present a general toolbox, based on new vertex sparsifiers, for designing data structures to maintain shortest paths in dynamic graphs. In an $m$-edge graph undergoing edge insertions and deletions, our data structures give the first algorithms for maintaining (a) $m^{o(1)}$-approximate all-pairs shortest paths (APSP) with \emph{worst-case} update time $m^{o(1)}$ and query time $\tilde{O}(1)$, and (b) a tree $T$ that has diameter no larger than a subpolynomial factor times the diameter of the underlying graph, where each update is handled in amortized subpolynomial time. In graphs undergoing only edge deletions, we develop a simpler and more efficient data structure to maintain a $(1+ε)$-approximate single-source shortest paths (SSSP) tree $T$ in a graph undergoing edge deletions in amortized time $m^{o(1)}$ per update. Our data structures are deterministic. The trees we can maintain are not subgraphs of $G$, but embed with small edge congestion into $G$. This is in stark contrast to previous approaches and is useful for algorithms that internally use trees to route flow. To illustrate the power of our new toolbox, we show that our SSSP data structure gives simple deterministic implementations of flow-routing MWU methods in several contexts, where previously only randomized methods had been known. To obtain our toolbox, we give the first algorithm that, given a graph $G$ undergoing edge insertions and deletions and a dynamic terminal set $A$, maintains a vertex sparsifier $H$ that approximately preserves distances between terminals in $A$, consists of at most $|A|m^{o(1)}$ vertices and edges, and can be updated in worst-case time $m^{o(1)}$. Crucially, our vertex sparsifier construction allows us to maintain a low edge-congestion embedding of $H$ into $G$, which is needed for our applications. - Open Access
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Given an $n$-vertex planar embedded digraph $G$ with non-negative edge weights and a face $f$ of $G$, Klein presented a data structure with $O(n\log n)$ space and preprocessing time which can answer any query $(u,v)$ for the shortest path distance in $G$ from $u$ to $v$ or from $v$ to $u$ in $O(\log n)$ time, provided $u$ is on $f$. This data structure is a key tool in a number of state-of-the-art algorithms and data structures for planar graphs. Klein's data structure relies on dynamic trees and the persistence technique as well as a highly non-trivial interaction between primal shortest path trees and their duals. The construction of our data structure follows a completely different and in our opinion very simple divide-and-conquer approach that solely relies on Single-Source Shortest Path computations and contractions in the primal graph. Our space and preprocessing time bound is $O(n\log |f|)$ and query time is $O(\log |f|)$ which is an improvement over Klein's data structure when $f$ has small size.Open AccessA Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Given an $n$-vertex planar embedded digraph $G$ with non-negative edge weights and a face $f$ of $G$, Klein presented a data structure with $O(n\log n)$ space and preprocessing time which can answer any query $(u,v)$ for the shortest path distance in $G$ from $u$ to $v$ or from $v$ to $u$ in $O(\log n)$ time, provided $u$ is on $f$. This data structure is a key tool in a number of state-of-the-art algorithms and data structures for planar graphs. Klein's data structure relies on dynamic trees and the persistence technique as well as a highly non-trivial interaction between primal shortest path trees and their duals. The construction of our data structure follows a completely different and in our opinion very simple divide-and-conquer approach that solely relies on Single-Source Shortest Path computations and contractions in the primal graph. Our space and preprocessing time bound is $O(n\log |f|)$ and query time is $O(\log |f|)$ which is an improvement over Klein's data structure when $f$ has small size.