Approximation and Hardness of Token Swapping.

Tillmann Miltzow Lothar Narins Yoshio Okamoto Günter Rote Antonis Thomas Takeaki Uno

Published in: ESA (2016)

Keyphrases

computational complexity
np hard
np complete
efficient computation
approximation schemes
approximation methods
approximation error
closed form
data sets
learning theory
error bounds
piecewise constant
phase transition
approximation algorithms
hidden markov models
expert systems
objective function
machine learning