Polynomial-Time Algorithm for Sliding Tokens on Trees.
Erik D. DemaineMartin L. DemaineEli Fox-EpsteinDuc A. HoangTakehiro ItoHirotaka OnoYota OtachiRyuhei UeharaTakeshi YamadaPublished in: CoRR (2014)
Keyphrases
- worst case
- computational complexity
- dynamic programming
- preprocessing
- detection algorithm
- cost function
- high accuracy
- theoretical analysis
- computational cost
- np hard
- optimal solution
- expectation maximization
- learning algorithm
- optimization algorithm
- input data
- times faster
- recognition algorithm
- improved algorithm
- linear programming
- experimental evaluation
- special case
- objective function
- feature selection
- data sets
- computationally efficient
- significant improvement
- evolutionary algorithm
- tree structure
- bayesian networks
- binary tree
- randomized algorithm
- polynomial time complexity
- strongly polynomial