Author

Mehrshad Taziki

h-index 1 View on Semantic Scholar

We have 1 of 5 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 Aug 2026

A Linear-Time Approximation Scheme for the Densest Subgraph Problem

This paper provides the first truly linear-time approximation scheme for the Densest Subgraph Problem, and uses assignments arising from a flow-based formulation together with a structural carving lemma to progressively carve "sparse" parts of the graph while nearly preserving the densest subgraph.

Elena Grigorescu, Mehrshad Taziki · 0 citations