Login / Signup
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem.
Isja Mannens
Jesper Nederlof
Céline M. F. Swennenhuis
Krisztina Szilágyi
Published in:
WG (2021)
Keyphrases
</>
parameterized complexity
traveling salesman problem
fixed parameter tractable
ant colony optimization
global constraints
genetic algorithm
np hard
search space
optimization problems
symmetry breaking
databases
optimal solution
xml documents
combinatorial optimization
connected components
relational data