Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.
Lasse KliemannAnand SrivastavPublished in: SEA (2009)
Keyphrases
- experimental study
- synthetic datasets
- theoretical analysis
- hypergraph model
- worst case
- stochastic search
- higher order
- evolutionary algorithm
- search algorithm
- decision trees
- significant improvement
- experimental evaluation
- data sets
- data structure
- feature selection
- orders of magnitude
- matching algorithm
- times faster
- shape matching
- learning algorithm
- hill climbing
- genetic algorithm
- neural network