Reducing rank-maximal to maximum weight matching
DOI10.1016/J.TCS.2007.08.004zbMATH Open1143.05068OpenAlexW1983273378MaRDI QIDQ2465632FDOQ2465632
Authors: 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Network flows. Theory, algorithms, and applications.
- An efficient cost scaling algorithm for the assignment problem
- Faster Scaling Algorithms for Network Problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Weak versus strong domination in a market with indivisible goods
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Title not available (Why is that?)
- Popular matchings
- On a conjecture by Gale about one-sided matching problems
- A decomposition theorem for maximum weight bipartite matchings
- Algorithms and Computation
Cited In (9)
- Fair matchings and related problems
- Pareto Stable Matchings under One-Sided Matroid Constraints
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
- A New Approach to the Pareto Stable Matching Problem
- Graded Matching for Large Observational Studies
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems
- Donation center location problem
- Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
- Pareto optimality in coalition formation
Uses Software
This page was built for publication: Reducing rank-maximal to maximum weight matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465632)
