Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP.
Zachary FriggstadRamin MousaviPublished in: ISAAC (2022)
Keyphrases
- approximation algorithms
- bicriteria
- np hard
- knapsack problem
- special case
- efficient solutions
- bounded degree
- traveling salesman problem
- flowshop
- worst case
- integer linear programming
- vertex cover
- optimal solution
- shortest path problem
- minimum cost
- scheduling problem
- approximation ratio
- graph theoretic
- genetic algorithm
- ant colony optimization
- constant factor
- search space
- np complete
- bounded treewidth
- constant factor approximation
- precedence constraints
- primal dual
- heuristic methods
- combinatorial optimization problems
- integer programming
- metaheuristic
- constraint satisfaction problems
- linear programming
- evolutionary algorithm