An exponential time 2-approximation algorithm for bandwidth.
Martin FürerSerge GaspersShiva Prasad KasiviswanathanPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- dynamic programming
- experimental evaluation
- learning algorithm
- optimization algorithm
- computational complexity
- k means
- detection algorithm
- improved algorithm
- computational cost
- times faster
- path planning
- error bounds
- significant improvement
- similarity measure
- probabilistic model
- high accuracy
- np hard
- cost function
- search space
- error tolerance
- linear complexity
- approximation methods
- efficient computation
- convergence rate
- randomized algorithm
- classification algorithm
- segmentation algorithm
- theoretical analysis
- computationally efficient
- particle swarm optimization
- worst case
- preprocessing
- objective function