The popular matching and condensation problems under matroid constraints
DOI10.1007/S10878-015-9965-8zbMATH Open1385.90023OpenAlexW2296415385MaRDI QIDQ346527FDOQ346527
Authors: Naoyuki Kamiyama 
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
Recommendations
- The popular matching and condensation problems under matroid constraints
- Popular matchings with ties and matroid constraints
- Popular matchings with two-sided preference lists and matroid constraints
- A characterization of weighted popular matchings under matroid constraints
- An optimal algorithm for the popular condensation problem
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cites Work
- Title not available (Why is that?)
- Improved Bounds for Matroid Partition and Intersection Algorithms
- The college admissions problem with lower and common quotas
- Title not available (Why is that?)
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A weighted matroid intersection algorithm
- A matroid approach to stable matchings with lower quotas
- An optimal algorithm for the popular condensation problem
- The generalized popular condensation problem
- Popular Matchings
- 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
- Popular matchings with variable item copies
- Popular matchings: structure and algorithms
- Optimal popular matchings
- Popular matchings in the weighted capacitated house allocation problem
Cited In (8)
- The generalized popular condensation problem
- A polyhedral approach for a constrained matching problem
- A characterization of weighted popular matchings under matroid constraints
- Solving the maximum popular matching problem with matroid constraints
- Pareto stable matchings under one-sided matroid constraints
- The popular matching and condensation problems under matroid constraints
- Popular matchings with ties and matroid constraints
- Popular matchings with two-sided preference lists and matroid constraints
This page was built for publication: The popular matching and condensation problems under matroid constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346527)
