An approximation algorithm for sequential rectangle placement.
Amos IsraeliOran SharonPublished in: Inf. Process. Lett. (2008)
Keyphrases
- experimental evaluation
- times faster
- preprocessing
- dynamic programming
- learning algorithm
- computational complexity
- simulated annealing
- cost function
- error bounds
- objective function
- approximation ratio
- k means
- knapsack problem
- high accuracy
- significant improvement
- genetic algorithm
- convex hull
- approximation schemes
- matching algorithm
- ant colony optimization
- optimization algorithm
- theoretical analysis
- expectation maximization
- linear programming
- probabilistic model
- computational cost
- np hard
- search space
- optimal solution