Quasi-popular Matchings, Optimality, and Extended Formulations

DOI10.1137/1.9781611975994.20OpenAlexW2938182455MaRDI QIDQ5146785

Telikepalli Kavitha, Yuri Faenza

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Popular Branchings and Their Dual Certificates ⋮ Finding popular branchings in vertex-weighted digraphs ⋮ Quasi-Popular Matchings, Optimality, and Extended Formulations ⋮ Popular matchings in complete graphs ⋮ Popular critical matchings in the many-to-many setting ⋮ Understanding Popular Matchings via Stable Matchings ⋮ Popular branchings and their dual certificates