Reducing rank-maximal to maximum weight matching

DOI10.1016/j.tcs.2007.08.004zbMath1143.05068OpenAlexW1983273378MaRDI QIDQ2465632

Dimitrios Michail

Publication date: 7 January 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.08.004

zbMATH Keywords

bipartite graphmatchingweighted matchingpreference listsrank-maximal

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Fair matchings and related problems ⋮ Graded Matching for Large Observational Studies ⋮ Donation center location problem ⋮ Pareto optimality in coalition formation ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints ⋮ A New Approach to the Pareto Stable Matching Problem ⋮ Approximation by lexicographically maximal solutions in matching and matroid intersection problems

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak versus strong domination in a market with indivisible goods
• An efficient cost scaling algorithm for the assignment problem
• On a conjecture by Gale about one-sided matching problems
• A Decomposition Theorem for Maximum Weight Bipartite Matchings
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Faster Scaling Algorithms for Network Problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Algorithms and Computation

This page was built for publication: Reducing rank-maximal to maximum weight matching