A kernelization algorithm for d-Hitting Set.
Faisal N. Abu-KhzamPublished in: J. Comput. Syst. Sci. (2010)
Keyphrases
- learning algorithm
- initial set
- experimental evaluation
- input data
- solution space
- theoretical analysis
- expectation maximization
- k means
- computational complexity
- dynamic programming
- computational cost
- detection algorithm
- improved algorithm
- similarity measure
- cost function
- np hard
- input pattern
- data sets
- optimal solution
- nearest neighbour
- segmentation algorithm
- optimization algorithm
- convex hull
- times faster
- conflict free
- clustering algorithm
- preprocessing
- matching algorithm
- classification algorithm
- tree structure
- objective function
- computationally efficient
- markov random field
- worst case
- significant improvement