Author

Morteza Alimi

2 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 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

The Matching Augmentation Problem (MAP) asks for a minimum-cardinality set of unit-cost edges that, together with a zero-cost matching, forms a 2-edge-connected spanning multigraph. We study the standard cut relaxation. Bamas, Drygala, and Svensson proposed a particularly simple LP-guided algorithm: compute an extreme...

Morteza Alimi, Tobias Mömke · 0 citations