A Faster, Better Approximation Algorithm for the Minimum Latency Problem.
Aaron ArcherAsaf LevinDavid P. WilliamsonPublished in: SIAM J. Comput. (2008)
Keyphrases
- detection algorithm
- experimental evaluation
- search space
- learning algorithm
- times faster
- closed form
- theoretical analysis
- high accuracy
- recognition algorithm
- monte carlo
- computational cost
- computational complexity
- preprocessing
- cost function
- np hard
- approximation methods
- convergence rate
- k means
- significant improvement
- neural network
- worst case
- dynamic programming
- energy function
- matching algorithm
- computationally efficient
- error bounds
- similarity measure
- polynomial time approximation