Skip to content

Author

Morteza Alimi

3 papers indexed here

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

An 8/5 Rounding for Half-Integral Forest-BCR via Root Supports and Circuit Rank

We study the rounding of a supplied half-integral feasible solution of the root-assignment bidirected cut relaxation for Steiner Forest (Forest-BCR). Byrka, Grandoni, and Traub [IPCO 2025] proved a $16/9$ guarantee for a recursive framework that normalizes the LP point, selects a vertex set of maximum projected LP dens...

Morteza Alimi · 0 citations
Sep 2026

Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness

In the unrestricted max--min metric $T$-join problem, one seeks an even terminal set $T$ maximizing the cost of a minimum $T$-join. Iwata and Ravi gave a factor-$3/2$ approximation for this problem. We show that this guarantee is tight under the Unique Games Conjecture: no polynomial-time approximation with factor stri...

A. Ahadi, Morteza Alimi, Sharareh Alipour et al. · 0 citations
Preprint Sep 2026

A $59/33$ Cut-LP Guarantee for Matching Augmentation

A new structural analysis of the Bamas--Drygala--Svensson LP-guided DFS algorithm is given, which combines an exact primal--dual identity for the residual uplink problem with a rank bound that measures fractional support relative to the unit-valued skeleton.

Morteza Alimi, Tobias Mömke · 0 citations

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