Pages that link to "Item:Q2941635"
From MaRDI portal
The following pages link to On the NP-hardness of approximating ordering-constraint satisfaction problems (Q2941635):
Displaying 7 items.
- A priori TSP in the scenario model (Q1801079) (← links)
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627) (← links)
- Approximating Bounded Occurrence Ordering CSPs (Q3167393) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Streaming approximation resistance of every ordering CSP (Q6581871) (← links)