The diameter of the stable marriage polytope: bounding from below
From MaRDI portal
Publication:2305917
DOI10.1016/j.disc.2019.111804zbMath1435.91127OpenAlexW2999623507WikidataQ126355078 ScholiaQ126355078MaRDI QIDQ2305917
Ioannis Mourtos, Dimitrios Magos, Pavlos Eirinakis
Publication date: 20 March 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.111804
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Every finite distributive lattice is a set of stable matchings
- A linear bound on the diameter of the transportation polytope
- Kernels in perfect line-graphs
- Graphs of transportation polytopes
- Linear programming brings marital bliss
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the stable marriage polytope
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- The Complexity of Counting Stable Marriages
- Three Fast Algorithms for Four Problems in Stable Marriage
- The travelling salesman problem and a class of polyhedra of diameter two
- Of Stable Marriages and Graphs, and Strategy and Polytopes
- Polyhedral Aspects of Stable Marriage
- From One Stable Marriage to the Next: How Long Is the Way?
- Algorithmics of Matching Under Preferences
- Erratum: The Stable Allocation (or Ordinal Transportation) Problem
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage
This page was built for publication: The diameter of the stable marriage polytope: bounding from below
