Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms.
Igal GolanPublished in: SIAM J. Comput. (1981)
Keyphrases
- recently developed
- data structure
- theoretical analysis
- upper and lower bounds
- worst case
- computationally efficient
- benchmark datasets
- data sets
- average case
- computational cost
- optimization problems
- theoretical guarantees
- data dependent
- graph theory
- error bounds
- data mining algorithms
- significant improvement
- lower bound
- image processing
- computer vision
- neural network