Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime.
Zachary FriggstadChaitanya SwamyPublished in: ICALP (2021)
Keyphrases
- related problems
- constant factor approximation
- np hard
- approximation algorithms
- traveling salesman problem
- travelling salesman
- response time
- optimal solution
- ant colony optimization
- closest string
- range searching
- search space
- genetic algorithm
- stable marriage
- broadly applicable
- optimization problems
- special case
- combinatorial optimization
- scheduling algorithm
- np complete
- linear programming
- lower bound
- worst case
- particle swarm optimization
- markov decision processes
- computational complexity
- knowledge compilation
- evolutionary algorithm
- scheduling problem
- data structure