Polynomial time algorithms for three-label point labeling.
Rob DuncanJianbo QianAntoine VigneronBinhai ZhuPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- computational complexity
- worst case
- connected component labeling
- computational cost
- times faster
- data structure
- special case
- optimization problems
- machine learning algorithms
- benchmark datasets
- nearest neighbor
- significant improvement
- np complete
- theoretical analysis
- constraint satisfaction problems
- classification algorithm
- combinatorial optimization