20 citations · 71 across the 26 of their papers we have counts for
6 papers · 1 filter
Fully Dynamic Algorithms for Euclidean Steiner Tree
T-H. Hubert Chan, Gramoz Goranci, Shaofeng H. -C. Jiang +2
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points in , possibly using points not in …
Fast Algorithms for Separable Linear Programs
Sally Dong, Gramoz Goranci, Lawrence Li +2
In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A promi…
Dynamic algorithms for k-center on graphs
Emilio Cruciani, Sebastian Forster, Gramoz Goranci +2
In this paper we give the first efficient algorithms for the -center problem on dynamic graphs undergoing edge updates. In this problem, the goal is to partition the input into…
Bootstrapping Dynamic Distance Oracles
Sebastian Forster, Gramoz Goranci, Yasamin Nazari +1
Designing approximate all-pairs distance oracles in the fully dynamic setting is one of the central problems in dynamic graph algorithms. Despite extensive research on this topic,…
Electrical Flows for Polylogarithmic Competitive Oblivious Routing
Gramoz Goranci, Monika Henzinger, Harald Räcke +2
Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polyl…
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai +3
Given a simple -vertex, -edge graph undergoing edge insertions and deletions, we give two new fully dynamic algorithms for exactly maintaining the edge connectivity of $G…