Near-Popular Matchings in the Roommates Problem

DOI10.1137/110852838zbMath1267.68166OpenAlexW1966569037MaRDI QIDQ5300479

Chien-Chung Huang, Telikepalli Kavitha

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/32fbf037d8f7ce2ae711909928eb3cfaa2f0bd5a

zbMATH Keywords

popular matchingroommates problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Maintaining Near-Popular Matchings ⋮ Quasi-Popular Matchings, Optimality, and Extended Formulations ⋮ Popular matchings in complete graphs ⋮ The Generalized Popular Condensation Problem ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Popular Matchings in Complete Graphs

This page was built for publication: Near-Popular Matchings in the Roommates Problem