A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.
Yossi AzarUriel FeigeDaniel GlasnerPublished in: SWAT (2008)
Keyphrases
- learning algorithm
- matching algorithm
- k means
- experimental evaluation
- expectation maximization
- optimal solution
- tree structure
- worst case
- computational complexity
- compact representations
- optimization algorithm
- scheduling problem
- probabilistic model
- np hard
- objective function
- neural network
- dynamic programming
- cost function
- high accuracy
- similarity measure
- significant improvement
- detection algorithm
- decision trees
- times faster
- recognition algorithm
- lower bound
- wavelet tree