A subexponential parameterized algorithm for Subset TSP on planar graphs.

Philip N. Klein Dániel Marx

Published in: SODA (2014)

Keyphrases

np hard
computational complexity
search space
simulated annealing
optimal solution
dynamic programming
worst case
special case
probabilistic model
maximum likelihood
binary images
piecewise linear
planar graphs