1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2016★ 1 cited
Improved Approximation for Weighted Tree Augmentation with Bounded Costs
David Adjiashvili
The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree , an additional set of edges $…
cs.DM2014
Labeling Schemes for Bounded Degree Graphs
David Adjiashvili, Noy Rotbart
We investigate adjacency labeling schemes for graphs of bounded degree . In particular, we present an optimal (up to an additive constant) adjacency labeli…
cs.DS2012
The Online Replacement Path Problem
David Adjiashvili, Marco Senatore
We study a natural online variant of the replacement path problem. The \textit{replacement path problem} asks to find for a given graph , two designated vertices $s,t\in…