Skip to content

Author

A. Vakilian

We have 6 of 42 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 Nov 2026

Tight Bounds for Sublinear Metric Steiner Tree

In the metric Steiner tree problem we are given an $n$-point metric space $(V,w)$ and a set $T\subseteq V$ of terminals, and we seek the smallest weight $\mathrm{OPT}$ of a tree that spans $T$ and may use points of $V\setminus T$. We study sublinear algorithms in the distance-oracle model, where the algorithm knows $V$...

S. Mahabadi, M. Roghani, Jakub Tarnawski et al. · 0 citations
Preprint Oct 2026

A Better Lower Bound for Sublinear Metric Steiner Tree

In the metric Steiner tree problem, we are given an $n$-point metric space $(V,w)$ and a set of terminals $T\subseteq V$, and we are interested in the smallest total weight $\mathsf{st}(V,T,w)$ of a tree that contains every terminal and may also use points of $V\setminus T$. We work in the distance-oracle model: the al...

S. Mahabadi, Jakub Tarnawski, A. Vakilian · 0 citations
Preprint Oct 2026

$k$-Center under Weak and Strong Distance Oracles with an Application to Minimum Sum of Radii Clustering

In the weak-strong distance oracle model of Bateni, Dharangutte, Jayaram and Wang (COLT 2024), a metric $(X,d)$ on $n$ points is accessed through two oracles: a cheap weak oracle that returns each queried distance correctly with probability $1-\delta$ and permits arbitrary values on corrupted pairs, chosen by an advers...

Zachary Friggstad, Mahya Jamshidian, A. Vakilian · 0 citations
Preprint Nov 2026

Approximation Algorithms for Multi-Criteria Network Design Problems

It is shown that exponentially better and nearly optimal guarantees are achievable for two fundamental network design problems: Min-max multi-criteria optimization and multi-criteria connectivity augmentation.

Mehrshad Taziki, A. Vakilian · 0 citations
Preprint Oct 2026

Learning-Augmented Streaming Algorithms for Approximating Boolean Max-CSPs

We study learning-augmented streaming algorithms for estimating the value of Boolean Maximum Constraint Satisfaction Problems (Max-CSPs). Specifically, we consider streaming algorithms equipped with an $\varepsilon$-accurate oracle: for each variable, the oracle outputs a label in $\{-1,1\}$ that agrees with a fixed op...

Yin-Hao Dong, Pan Peng, A. Vakilian et al. · 0 citations
Preprint Aug 2026

A Configuration-LP Framework for Connected $k$-Median Clustering

The results provide a different LP-based approach for handling connectivity constraints in clustering problems and demonstrate that configuration LPs, covering LPs, and rooted density oracles can be combined effectively to obtain approximation guarantees for clustering objectives under graph-theoretic constraints.

Kushagra Chatterjee, Rojin Rezvan, A. Vakilian · 0 citations

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