66 citations · 154 across the 32 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
We study the classical NP-hard problems of finding maximum-size subsets from given sets of terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint p…
cs.DS2016★ 4 cited
Stable Marriage with Covering Constraints: A Complete Computational Trichotomy
Matthias Mnich, Ildikó Schlotter
We consider Stable Marriage with Covering Constraints (SMC): in this variant of Stable Marriage, we distinguish a subset of women as well as a subset of men, and we seek a matching…