Fair matchings and related problems
From MaRDI portal
Publication:270032
DOI10.1007/s00453-015-9994-9zbMath1333.05241OpenAlexW2058397899MaRDI QIDQ270032
Dimitrios Michail, Telikepalli Kavitha, Kurt Mehlhorn, Chien-Chung Huang
Publication date: 6 April 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/4384/
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Socially fair matching: exact and approximation algorithms, Rank-maximal matchings -- structure and algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum weight bipartite matching in matrix multiplication time
- New scaling algorithms for the assignment and minimum mean cycle problems
- Reducing rank-maximal to maximum weight matching
- Minimum cycle bases
- Rank-maximal matchings
- Finding Minimum-Cost Circulations by Successive Approximation
- Algebraic Algorithms for Matching and Matroid Problems
- Faster Scaling Algorithms for Network Problems
- Scaling Algorithms for the Shortest Paths Problem
- Capacitated Rank-Maximal Matchings
- Fibonacci heaps and their uses in improved network optimization algorithms
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
- Algorithms – ESA 2004
- Algorithms – ESA 2005
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- College Admissions and the Stability of Marriage
