Skip to content

Author

Tobias Mömke

1 paper 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

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

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