Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy.
Michael GnewuchPublished in: CoRR (2024)
Keyphrases
- worst case
- improved algorithm
- randomized algorithm
- computational complexity
- constant factor
- average case
- lower bound
- detection algorithm
- cost function
- experimental evaluation
- computational cost
- preprocessing
- computational effort
- probabilistic model
- learning algorithm
- lower and upper bounds
- theoretical analysis
- simulated annealing
- error tolerance
- tight bounds
- approximation algorithms
- dynamic programming
- np hard
- k means
- search space
- optimal solution
- times faster
- matching algorithm
- recognition algorithm
- upper bound
- space complexity
- significant improvement
- mistake bound
- branch and bound search
- objective function