Deepening the (parameterized) complexity analysis of incremental stable matching problems

DOI10.4230/LIPICS.MFCS.2022.21MaRDI QIDQ6584015zbMATH OpenFDO

Authors Niclas Boehmer, Klaus Heeger, Rolf Niedermeier

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.21

zbMATH Keywords

adapting to changing preferencesFPTincremental algorithmsmaster listsNP-hardnessstable marriagestable roommatesW[1-hardness]XP

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Adapting stable matchings to forced and forbidden pairs
• Adapting stable matchings to evolving preferences

This page was built for publication: Deepening the (parameterized) complexity analysis of incremental stable matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584015)