On an explicit lower bound for the star discrepancy in three dimensions.
Florian PuchhammerPublished in: Math. Comput. Simul. (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- optimal solution
- np hard
- branch and bound
- objective function
- worst case
- sample complexity
- upper and lower bounds
- linear programming relaxation
- competitive ratio
- branch and bound method
- multi dimensional
- knapsack problem
- knowledge base
- lower bounding
- polynomial approximation