Pages that link to "Item:Q456691"
From MaRDI portal
The following pages link to Stable assignment with couples: parameterized complexity and local search (Q456691):
Displayed 11 items.
- Matching couples with Scarf's algorithm (Q314433) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Searching for better fill-in (Q2453556) (← links)
- MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY (Q2854007) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)