Stable Assignment with Couples: Parameterized Complexity and Local Search

DOI10.1007/978-3-642-11269-0_25zbMath1273.68184OpenAlexW1709918996MaRDI QIDQ3656871

Ildikó Schlotter, Dániel Marx

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Transversal (matching) theory (05D15)

Related Items (2)

The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT ⋮ Matching with sizes (or scheduling with processing set restrictions)

This page was built for publication: Stable Assignment with Couples: Parameterized Complexity and Local Search