Pages that link to "Item:Q2464332"
From MaRDI portal
The following pages link to The parameterized approximability of TSP with deadlines (Q2464332):
Displaying 13 items.
- Approximation hardness of deadline-TSP reoptimization (Q1019743) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Adversarial patrolling with spatially uncertain alarm signals (Q2407886) (← links)
- Cyclic-routing of unmanned aerial vehicles (Q2424667) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Deadline TSP (Q5925174) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
