Pages that link to "Item:Q1884845"
From MaRDI portal
The following pages link to Randomized approximation of the stable marriage problem (Q1884845):
Displaying 18 items.
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Better and simpler approximation algorithms for the stable marriage problem (Q547284) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
- Satisfied two-sided matching: a method considering elation and disappointment of agents (Q1626247) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- Research and development of fringe projection-based methods in 3D shape reconstruction (Q2508235) (← links)
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem (Q3541122) (← links)
- Distributed Weighted Stable Marriage Problem (Q3569114) (← links)
- An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage (Q3608878) (← links)
- Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory (Q4376193) (← links)
- Progress in Cryptology - INDOCRYPT 2004 (Q5712208) (← links)
- Algorithms and Computation (Q5897922) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
