Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems

DOI10.1007/11940128_17zbMath1135.05314OpenAlexW1736880087MaRDI QIDQ5459111

Telikepalli Kavitha, Chintan D. Shah

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_17

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (8)

Fair matchings and related problems ⋮ Dynamic rank-maximal and popular matchings ⋮ The dynamics of rank-maximal and popular matchings ⋮ Rank-maximal matchings -- structure and algorithms ⋮ Popular and clan-popular \(b\)-matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ A New Approach to the Pareto Stable Matching Problem ⋮ Weighted popular matchings

This page was built for publication: Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems