Pages that link to "Item:Q3167393"
From MaRDI portal
The following pages link to Approximating Bounded Occurrence Ordering CSPs (Q3167393):
Displaying 5 items.
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- On the NP-hardness of approximating ordering-constraint satisfaction problems (Q2941635) (← links)
- Local search is better than random assignment for bounded occurrence Ordering k-CSPs (Q2957878) (← links)
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627) (← links)