Minimum sum coloring problem: Upper bounds for the chromatic strength.
Clément LecatCorinne LucetChu-Min LiPublished in: Discret. Appl. Math. (2017)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- color images
- branch and bound algorithm
- worst case
- tight bounds
- branch and bound
- lower and upper bounds
- generalization error
- sample size
- error probability
- upper bounding
- efficiently computable
- data structure
- closed form expressions
- data sets
- data mining
- tight upper and lower bounds
- vc dimension
- sample complexity
- human perception
- color information
- similarity measure
- search engine