Balanced stable marriage: how close is close enough?

DOI10.1007/978-3-030-24766-9_31OpenAlexW2966591488MaRDI QIDQ5919317

Saket Saurabh, Sanjukta Roy, Meirav Zehavi, Sushmita Gupta

Publication date: 16 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.09545

zbMATH Keywords

parameterized complexitykernelizationbalanced stable marriage

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (3)

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) ⋮ Stable marriage with groups of similar agents ⋮ Solving hard stable matching problems involving groups of similar agents

This page was built for publication: Balanced stable marriage: how close is close enough?