Pages that link to "Item:Q3562992"
From MaRDI portal
The following pages link to Improved Approximations for TSP with Simple Precedence Constraints (Q3562992):
Displaying 7 items.
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
- The parameterized approximability of TSP with deadlines (Q2464332) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q2861508) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Improved approximations for ordered TSP on near-metric graphs (Q5248874) (← links)