scientific article; zbMATH DE number 6469133

MaRDI QIDQ5501244zbMATH OpenFDO

Authors Robert W. Irving, Telikepalli Kavitha, K. Mehlhorn, Dimitrios Michail, Katarzyna Paluch

Publication date 3 August 2015

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Rank-maximal matchings
• Capacitated Rank-Maximal Matchings
• Maximal rank in matrix spaces via graph matchings
• Dynamic rank-maximal matchings
• Matchability and \(k\)-maximal matchings
• scientific article; zbMATH DE number 4114698
• Classified rank-maximal matchings and popular matchings -- algorithms and hardness
• Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems

Cited in

(14)

• Manipulation strategies for the rank-maximal matching problem
• Donation center location problem
• Assigning papers to referees
• Dynamic rank-maximal matchings
• Reducing rank-maximal to maximum weight matching
• House-swapping with divorcing and engaged pairs
• Rank-maximal matchings
• scientific article; zbMATH DE number 4114698 (Why is no real title available?)
• Capacitated Rank-Maximal Matchings
• Max-min greedy matching
• scientific article; zbMATH DE number 4185816 (Why is no real title available?)
• Bounded unpopularity matchings
• On stable marriages and greedy matchings
• A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem

This page was built for publication:

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