The popular matching and condensation problems under matroid constraints
From MaRDI portal
Publication:346527
DOI10.1007/s10878-015-9965-8zbMath1385.90023OpenAlexW2296415385MaRDI QIDQ346527
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9965-8
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Matching models (91B68)
Related Items (3)
Popular Matchings with Ties and Matroid Constraints ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Popular matchings with variable item copies
- Popular matchings: structure and algorithms
- Optimal popular matchings
- Popular matchings in the weighted capacitated house allocation problem
- The college admissions problem with lower and common quotas
- Popularity at minimum cost
- A Matroid Approach to Stable Matchings with Lower Quotas
- An Optimal Algorithm for the Popular Condensation Problem
- The Generalized Popular Condensation Problem
- Popular Matchings
- Improved Bounds for Matroid Partition and Intersection Algorithms
- A weighted matroid intersection algorithm
- Matroid intersection algorithms
- A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis
- Popular Matchings in the Capacitated House Allocation Problem
- Weighted popular matchings
- Matching Theory for Combinatorial Geometries
- A Fixed-Point Approach to Stable Matchings and Some Applications
This page was built for publication: The popular matching and condensation problems under matroid constraints
