On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.

Yoichi Iwata Tomoaki Ogasawara Naoto Ohsaka

Published in: CoRR (2017)

Keyphrases

computational complexity
significant improvement
theoretical analysis
orders of magnitude
computationally efficient
learning algorithm
data structure
tree structure
computational cost
worst case
multi dimensional
index structure
combinatorial optimization
maximum weight