Lower Bounds for Simplicial Covers and Triangulations of Cubes.
Adam BlissFrancis Edward SuPublished in: Discret. Comput. Geom. (2005)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- objective function
- worst case
- optimal solution
- data cube
- betti numbers
- vc dimension
- optimal cost
- quadratic assignment problem
- book covers
- max sat
- lower bounding
- randomly generated problems
- genetic algorithm
- set of randomly generated instances