Gramoz Goranci

activity

20162026

most citedThe Power of Vertex Sparsifiers in Dynamic Graph Algorithms

6 citations · 16 across the 18 of their papers we have counts for

collaborators

Showing 2022 · cs.DSShow all

2 papers · 2 filters

cs.DS2022

Incremental Approximate Maximum Flow in $m^{1/2 + o (1)}$ update time

Gramoz Goranci, Monika Henzinger

We show an $(1 + ε)$ -approximation algorithm for maintaining maximum $s$ - $t$ flow under $m$ edge insertions in $m^{1/2 + o (1)} ε^{- 1/2}$ amortized update time for directed, unweighted…

cs.DS2022

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time

Sally Dong, Yu Gao, Gramoz Goranci +4

We present a nearly-linear time algorithm for finding a minimum-cost flow in planar graphs with polynomially bounded integer costs and capacities. The previous fastest algorithm fo…

Incremental Approximate Maximum Flow in m1/2+o(1) update time

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time

Incremental Approximate Maximum Flow in $m^{1/2 + o (1)}$ update time