A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number.

René van Bevern Daniel A. Skachkov

Published in: CoRR (2022)

Keyphrases

traveling salesman problem
vertex cover
combinatorial optimization
computational complexity
ant colony optimization
traveling salesman
approximation algorithms
reinforcement learning
objective function
lower bound
search space
optimization problems
belief propagation
valid inequalities