2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence.
Alexander Kel'manovSergey A. KhamidullinAnna PanasenkoPublished in: NUMTA (2) (2019)
Keyphrases
- approximation ratio
- worst case
- dynamic programming
- learning algorithm
- cost function
- detection algorithm
- k means
- optimal solution
- closed form
- matching algorithm
- polynomial time approximation
- experimental evaluation
- preprocessing
- probabilistic model
- computational cost
- np hard
- theoretical analysis
- computational complexity
- approximation algorithms
- polynomial size
- error bounds
- input data
- knn
- state space
- lower bound