Lower bounds for approximate polygon decomposition and minimum gap.
Joachim GudmundssonThore HusfeldtChristos LevcopoulosPublished in: Inf. Process. Lett. (2002)
Keyphrases
- lower bound
- upper bound
- exact solution
- constant factor
- branch and bound
- exact and approximate
- objective function
- branch and bound algorithm
- np hard
- provide an upper bound
- vc dimension
- wavelet packet
- lower and upper bounds
- min sum
- randomly generated problems
- convex hull
- upper and lower bounds
- lower bounding
- optimal solution
- data sets
- efficient computation
- optimal cost
- minimum length
- worst case
- decomposition methods
- decomposition method
- max sat
- lagrangian relaxation