Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees.
Svein HøgemoPublished in: CoRR (2024)
Keyphrases
- search space
- worst case
- tree structure
- theoretical analysis
- error bounds
- dynamic programming
- cost function
- detection algorithm
- np hard
- exhaustive search
- average case
- learning algorithm
- preprocessing
- search strategy
- computational complexity
- objective function
- standard deviation
- branch and bound search
- closed form
- randomized algorithm
- search algorithm
- optimal solution
- segmentation algorithm
- expectation maximization
- linear programming
- upper bound
- solution space
- k means
- lower bound
- relative error
- search mechanism
- constant factor
- polynomial time approximation
- similarity measure