Near-Linear Time Algorithm for n-fold ILPs via Color Coding.
Klaus JansenAlexandra LassotaLars RohwedderPublished in: ICALP (2019)
Keyphrases
- dynamic programming
- cost function
- worst case
- optimization algorithm
- k means
- experimental evaluation
- high accuracy
- preprocessing
- significant improvement
- objective function
- recognition algorithm
- detection algorithm
- segmentation algorithm
- learning algorithm
- convex hull
- times faster
- image coding
- color image segmentation
- computational cost
- np hard
- data structure
- optimal solution
- similarity measure
- decision trees