Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation.
Mourad El OualiVolkmar SauerlandPublished in: IWOCA (2013)
Keyphrases
- computational complexity
- improved algorithm
- randomized algorithm
- learning algorithm
- space complexity
- k means
- preprocessing
- theoretical analysis
- times faster
- search space
- constant factor
- optimization algorithm
- segmentation algorithm
- convergence rate
- np hard
- matching algorithm
- memory requirements
- linear programming
- dynamic programming
- query complexity
- decision trees
- method reduces the number
- undirected graph
- neural network
- query evaluation
- range queries
- closed form
- simulated annealing
- worst case
- query processing
- data streams
- optimal solution
- objective function
- genetic algorithm