A lower bound for the dimension of tetrahedral splines in large degree.
Michael DiPasqualeNelly VillamizarPublished in: CoRR (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- b spline
- objective function
- optimal solution
- lower and upper bounds
- lower bounding
- worst case
- competitive ratio
- sufficiently accurate
- machine learning
- linear programming relaxation
- post processing
- multi dimensional
- special case
- computational complexity
- case study
- social networks