Faster and Simpler Approximation of Stable Matchings

DOI10.1007/978-3-642-29116-6_15zbMath1242.68371arXiv0911.5660OpenAlexW1631590542MaRDI QIDQ2896388

Katarzyna E. Paluch

Publication date: 16 July 2012

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Matching models (91B68)

Related Items (5)

Improved approximation algorithms for two variants of the stable marriage problem with ties ⋮ Maximum locally stable matchings ⋮ Linear time local approximation algorithm for maximum stable marriage ⋮ Faster and simpler approximation of stable matchings ⋮ Editorial: Special issue on matching under preferences

This page was built for publication: Faster and Simpler Approximation of Stable Matchings