3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2026
On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
Martin Nägele, Christian Nöbel, Rico Zenklusen
The odd-red bipartite perfect matching problem asks to find a perfect matching containing an odd number of red edges in a given red-blue edge-colored bipartite graph. While this pr…
cs.DS2023★ 3 cited
A Better-Than-1.6-Approximation for Prize-Collecting TSP
Jannis Blauth, Nathan Klein, Martin Nägele
Prize-Collecting TSP is a variant of the traveling salesperson problem where one may drop vertices from the tour at the cost of vertex-dependent penalties. The quality of a solutio…
cs.DS2023
Advances on Strictly -Modular IPs
Martin Nägele, Christian Nöbel, Richard Santiago +1
There has been significant work recently on integer programs (IPs) with a constraint marix with bounded subdeterminants.…