Packing Cubes into a Cube Is NP-Hard in the Strong Sense.
Yiping LuDanny Z. ChenJianzhong ChaPublished in: COCOON (2013)
Keyphrases
- np hard
- data cube
- approximation algorithms
- np complete
- multi dimensional
- linear programming
- optimal solution
- closely related
- scheduling problem
- integer programming
- minimum cost
- packing problem
- special case
- lower bound
- aggregate queries
- high level
- aggregate functions
- data warehouse
- greedy heuristic
- np hardness
- set cover
- real time
- remains np hard
- space time
- worst case
- computational complexity
- case study
- knowledge base
- information systems
- machine learning
- databases