scientific article; zbMATH DE number 7561396
From MaRDI portal
Publication:5091034
DOI10.4230/LIPIcs.ISAAC.2018.42MaRDI QIDQ5091034
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Core and stability notions in many-to-one matching markets with indifferences ⋮ Marriage market with indifferences: a linear programming approach ⋮ The stable marriage problem with ties and restricted edges
Cites Work
- Unnamed Item
- Unnamed Item
- Better and simpler approximation algorithms for the stable marriage problem
- Efficient algorithms for generalized stable marriage and roommates problems
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- A new fixed point approach for stable networks and stable marriages
- Stable marriage and indifference
- Network flow and 2-satisfiability
- Hard variants of stable marriage.
- The structure of stable marriage with indifference
- Faster and simpler approximation of stable matchings
- A data structure for dynamic trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The Geometry of Fractional Stable Matchings and Its Applications
- Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
- A 3/2-Approximation Algorithm for General Stable Marriage
- Stable Matchings, Optimal Assignments, and Linear Programming
- Characterisation of Strongly Stable Matchings
- The Strongly Stable Roommates Problem
- Faster Scaling Algorithms for Network Problems
- Algorithmics of Matching Under Preferences
- College Admissions and the Stability of Marriage
This page was built for publication:
