Gramoz Goranci

Gramoz Goranci

Auto-generated profile, based on publicly available information

Gramoz Goranci

Faculty of Computer Science, University of Vienna, Vienna, Austria

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

7 January 2017
Verified
Book Chapter
Closed access
PDF file
GGGramoz Goranci
Gramoz Goranci
HRHarald Räcke
Harald Räcke

29 February 2024
Verified
Book Chapter
Closed access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
GGGramoz Goranci
Gramoz Goranci
SJShaofeng H.-C. Jiang
Shaofeng H.-C. Jiang
BWBo Wang
Bo Wang
QXQuan Xue
Quan Xue

26 July 2025 in Journal of the ACM
Verified
Journal Article
Open access
SDSally Dong
Sally Dong
YGYu Gao
Yu Gao
GGGramoz Goranci
Gramoz Goranci
YLYin Tat Lee
Yin Tat Lee
SSSushant Sachdeva
Sushant Sachdeva
GYGuanghao Ye
Guanghao Ye
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 for this problem is based on interior point methods (IPMs) and works for general sparse graphs in O ( n 1.5 ⋅ poly (log n )) time [Daitch-Spielman, STOC’08]. Intuitively, Ω ( n 1.5 ) is a natural runtime barrier for IPM-based methods, since they require \(\sqrt {n}\) iterations, each routing a possibly-dense electrical flow. To break this barrier, we develop a new implicit representation for flows based on generalized nested dissection [Lipton-Rose-Tarjan, SINUM’79] and approximate Schur complements [Kyng-Sachdeva, FOCS’16]. This implicit representation permits us to design a data structure to route an electrical flow with sparse demands in roughly \(\sqrt {n}\) update time, resulting in a total runtime of O ( n ⋅ poly (log n )). Our results immediately extend to all families of separable graphs.

25 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
SDSally Dong
Sally Dong
GGGramoz Goranci
Gramoz Goranci
LLLawrence Li
Lawrence Li
SSSushant Sachdeva
Sushant Sachdeva
GYGuanghao Ye
Guanghao Ye
In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A prominent success story is the method of generalized nested dissection~[Lipton-Rose-Tarjan'79] for separable matrices. On the other hand, the majority of recent developments in the design of efficient linear program (LP) solves do not leverage the ideas underlying these faster linear system solvers nor consider the separable structure of the constraint matrix. We give a faster algorithm for separable linear programs. Specifically, we consider LPs of the form $\min_{\mathbf{A}\mathbf{x}=\mathbf{b}, \mathbf{l}\leq\mathbf{x}\leq\mathbf{u}} \mathbf{c}^\top\mathbf{x}$, where the graphical support of the constraint matrix $\mathbf{A} \in \mathbb{R}^{n\times m}$ is $O(n^α)$-separable. These include flow problems on planar graphs and low treewidth matrices among others. We present an $\tilde{O}((m+m^{1/2 + 2α}) \log(1/ε))$ time algorithm for these LPs, where $ε$ is the relative accuracy of the solution. Our new solver has two important implications: for the $k$-multicommodity flow problem on planar graphs, we obtain an algorithm running in $\tilde{O}(k^{5/2} m^{3/2})$ time in the high accuracy regime; and when the support of $\mathbf{A}$ is $O(n^α)$-separable with $α\leq 1/4$, our algorithm runs in $\tilde{O}(m)$ time, which is nearly optimal. The latter significantly improves upon the natural approach of combining interior point methods and nested dissection, whose time complexity is lower bounded by $Ω(\sqrt{m}(m+m^{αω}))=Ω(m^{3/2})$, where $ω$ is the matrix multiplication constant. Lastly, in the setting of low-treewidth LPs, we recover the results of [DLY,STOC21] and [GS,22] with significantly simpler data structure machinery.

30 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
TCT-H. Hubert Chan
T-H. Hubert Chan
GGGramoz Goranci
Gramoz Goranci
SJShaofeng H. -C. Jiang
Shaofeng H. -C. Jiang
BWBo Wang
Bo Wang
QXQuan Xue
Quan Xue
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points $X$ in $\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear time $(1 + ε)$-approximation was obtained in the offline setting in seminal works of Arora and Mitchell, efficient dynamic algorithms for Steiner tree is still open. We give the first algorithm that (implicitly) maintains a $(1 + ε)$-approximate solution which is accessed via a set of tree traversal queries, subject to point insertion and deletions, with amortized update and query time $O(\poly\log n)$ with high probability. Our approach is based on an Arora-style geometric dynamic programming, and our main technical contribution is to maintain the DP subproblems in the dynamic setting efficiently. We also need to augment the DP subproblems to support the tree traversal queries.