Pages that link to "Item:Q930600"
From MaRDI portal
The following pages link to A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600):
Displaying 10 items.
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Satisfied two-sided matching: a method considering elation and disappointment of agents (Q1626247) (← links)
- Faster and simpler approximation of stable matchings (Q1736612) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- The aviation technology two-sided matching with the expected time based on the probabilistic linguistic preference relations (Q2176823) (← links)
- On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
- An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage (Q3608878) (← links)
- Algorithm Theory - SWAT 2004 (Q5315387) (← links)
- Algorithms - ESA 2003 (Q5897252) (← links)
- Algorithms and Computation (Q5897922) (← links)