On the average performanve of some algorithms for one-line-packing.
Giorgio GambosiAlberto PostiglioneMaurizio TalamoPublished in: Bull. EATCS (1990)
Keyphrases
- computational cost
- orders of magnitude
- data structure
- times faster
- worst case
- optimization problems
- machine learning
- recently developed
- significant improvement
- upper bound
- computationally efficient
- space complexity
- real time
- graph theory
- classification algorithm
- computational complexity
- case study
- databases
- data sets