STACS 2004
From MaRDI portal
Publication:5309702
DOI10.1007/b96012zbMath1122.68459OpenAlexW4236485840MaRDI QIDQ5309702
Katarzyna E. Paluch, Dimitrios Michail, Telikepalli Kavitha, Kurt Mehlhorn
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Related Items
Equivalence of two-sided stable matching, A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem, The stable marriage problem with master preference lists
