Skip to content

Author

Aurelio L. Sulser

We have 2 of 6 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Low-Stretch Spanning Trees via Smoothed Analysis of Dijkstra's Algorithm

Given an undirected weighted graph $G$, a $\gamma$-approximate low-stretch spanning tree (LSST) $T \subseteq G$ is a tree that approximates the distance metric of $G$ up to a $\gamma$-factor in expectation. Currently, existing algorithms to find a provably good LSST carefully construct an approximate shortest-path tree...

Ioannis Dorkofikis, Bernhard Haeupler, Maximilian Probst Gutenberg et al. · 0 citations
Conference 2026

Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow

This work presents the first polylog-depth, nearly-linear-work parallel algorithm that achieves a (1 + ε )- bicriteria approximation guarantee for undirected minimum-cost flow on expanders and suggests a promising route toward e O ( m/ε ) work and e O (1 /ε ) depth algorithms for approximate undirected minimum-cost flo...

Rasmus Kyng, Aurelio L. Sulser · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.