2 citations · 2 across the 3 of their papers we have counts for
4 papers
A Linear-Time Approximation Scheme for the Densest Subgraph Problem
Elena Grigorescu, Mehrshad Taziki
In the undirected \emph{Densest Subgraph Problem (DSG)} the goal is to output a subset of vertices of a given graph that maximizes the quantity , where i…
Dual Charging for Half-Integral TSP
Nathan Klein, Mehrshad Taziki
We show that the max entropy algorithm is a randomized 1.49776 approximation for half-integral TSP, improving upon the previous known bound of 1.49993 from Karlin et al. This also…
Relative Fractional Packing Number and Its Properties
Mehrshad Taziki
The concept of the \textit{relative fractional packing number} between two graphs and , initially introduced in arXiv:2307.06155 [math.CO], serves as an upper bound for the…
On the Ratio of Shannon Numbers of Graphs
Sharareh Alipour, Amin Gohari, Mehrshad Taziki
Let be a function that maps two arbitrary graphs and to a non-negative real number such that where is any natu…