Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density.
Sándor P. FeketeSebastian MorrChristian SchefferPublished in: Discret. Comput. Geom. (2019)
Keyphrases
- greedy heuristic
- greedy algorithm
- worst case analysis
- worst case
- optimal solution
- dynamic programming
- data sets
- genetic algorithm
- average case
- error bounds
- learning algorithm
- hough transform
- times faster
- upper bound
- computational complexity
- approximation algorithms
- packing problem
- data structure
- running times
- bayesian networks