A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.
Yao XuYong ChenGuohui LinTian LiuTaibo LuoPeng ZhangPublished in: ISAAC (2017)
Keyphrases
- dynamic programming
- approximation ratio
- experimental evaluation
- np hard
- recognition algorithm
- worst case
- computational cost
- improved algorithm
- cost function
- learning algorithm
- linear programming
- significant improvement
- preprocessing
- computational complexity
- optimal solution
- data sets
- computationally efficient
- segmentation algorithm
- optimization algorithm
- detection algorithm
- matching algorithm
- error bounds
- selection algorithm
- complexity analysis
- randomized approximation
- approximation algorithms
- convergence rate
- times faster
- closed form
- expectation maximization
- input data
- special case
- k means
- search algorithm
- objective function
- decision trees