Kernelization Lower Bounds Through Colors and IDs.
Michael DomDaniel LokshtanovSaket SaurabhPublished in: ACM Trans. Algorithms (2014)
Keyphrases
- lower bound
- upper bound
- intrusion detection system
- branch and bound
- color images
- branch and bound algorithm
- lower and upper bounds
- intrusion detection
- objective function
- np hard
- color space
- upper and lower bounds
- color matching
- lower bounding
- quadratic assignment problem
- color information
- optimal solution
- color quantization
- optimal cost
- min sum
- small number
- sample complexity
- vc dimension
- color histogram
- data sets
- color distribution
- linear programming relaxation
- constraint satisfaction problems
- randomly generated problems