d-strong chromatic index and its trivial lower bound.
Martina MockovciakováRoman SotákPublished in: Discret. Math. (2013)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- index structure
- color images
- np hard
- database
- lower and upper bounds
- b tree
- optimal solution
- objective function
- upper and lower bounds
- human perception
- structural similarity
- image processing
- competitive ratio
- vc dimension
- lagrangian relaxation
- constant factor
- color information
- multi dimensional
- worst case
- genetic algorithm
- neural network