Pages that link to "Item:Q5757893"
From MaRDI portal
The following pages link to On the Approximation Hardness of Some Generalizations of TSP (Q5757893):
Displaying 7 items.
- Improved approximations for TSP with simple precedence constraints (Q396660) (← links)
- Approximation hardness of deadline-TSP reoptimization (Q1019743) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
- Improved approximations for ordered TSP on near-metric graphs (Q5248874) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)