Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems

DOI10.1007/11940128_17MaRDI QIDQ5459111zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Matchings in Graphs Variations of the Problem
• Reducing rank-maximal to maximum weight matching
• Rank-maximal matchings

Cited in

(23)

• Popular and clan-popular b-matchings
• Dynamic rank-maximal and popular matchings
• Competitive weighted matching in transversal matroids
• Reducing rank-maximal to maximum weight matching
• Fair matchings and related problems
• Rank-maximal matchings
• Fair matchings and related problems
• Competitive Weighted Matching in Transversal Matroids
• Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
• A new class of heuristic algorithms for weighted perfect matching
• Capacitated Rank-Maximal Matchings
• Perturbation analysis of maximum-weighted bipartite matchings with low rank data
• Exact algorithms for minimum weighted dominating induced matching
• A new approach to the Pareto stable matching problem
• Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
• scientific article; zbMATH DE number 6469133 (Why is no real title available?)
• Weighted popular matchings
• Maximum bipartite matchings with low rank data: locality and perturbation analysis
• The dynamics of rank-maximal and popular matchings
• Improved truthful rank approximation for rank-maximal matchings
• Truthful approximation for rank-maximal matchings
• Deterministic and universal truthful mechanism for fair matching
• Popular matchings in the weighted capacitated house allocation problem

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

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