Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density.
Sebastian MorrPublished in: SODA (2017)
Keyphrases
- worst case
- optimal solution
- dynamic programming
- average case
- np hard
- experimental evaluation
- packing problem
- objective function
- computational complexity
- significant improvement
- cost function
- computational cost
- theoretical analysis
- input data
- times faster
- knapsack problem
- preprocessing
- worst case analysis
- globally optimal
- running times
- detection algorithm
- optimization algorithm
- high accuracy
- linear programming
- neural network
- k means
- search space
- segmentation algorithm
- expectation maximization
- upper bound
- exhaustive search
- evolutionary algorithm
- optimal path
- lower bound
- greedy heuristic
- locally optimal
- similarity measure