An improved upper bound and algorithm for clique covers.
Ryan McIntyreMichael SoltysPublished in: J. Discrete Algorithms (2018)
Keyphrases
- upper bound
- experimental evaluation
- worst case
- significant improvement
- detection algorithm
- times faster
- dynamic programming
- simulated annealing
- theoretical analysis
- improved algorithm
- k means
- expectation maximization
- path planning
- preprocessing
- optimal solution
- segmentation algorithm
- tree structure
- probabilistic model
- high accuracy
- cost function
- constant factor
- data sets
- input data
- np hard
- search space
- neural network