Subquadratic algorithms for succinct stable matching

DOI10.1007/978-3-319-34171-2_21MaRDI QIDQ6828532zbMATH OpenFDO

Authors Daniel Möller, Ramamohan Paturi, Stefan Schneider

Publication date 25 July 2016

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

zbMATH Keywords

stable matchingconditional lower boundsattribute modelsethsubquadratic algorithms

Mathematics Subject Classification ID

Individual preferences (91B08) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)

This page was built for publication: Subquadratic algorithms for succinct stable matching

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