The following pages link to (Q3002787):
Displaying 12 items.
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
- Asymmetric traveling salesman path and directed latency problems (Q2862204) (← links)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
- On the LP relaxation of the asymmetric traveling salesman path problem (Q3002798) (← links)
- An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
- The Directed Minimum Latency Problem (Q3541796) (← links)
- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs (Q3603459) (← links)
- A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766) (← links)
- On the Integrality Ratio for the Asymmetric Traveling Salesman Problem (Q5387977) (← links)
- The asymmetric traveling salesman path LP has constant integrality ratio (Q5918918) (← links)
- Multi-candidate carpooling routing problem and its approximation algorithms (Q6606200) (← links)