Strong hardness of approximation for tree transversals.
Euiwoong LeePengxiang WangPublished in: Inf. Process. Lett. (2023)
Keyphrases
- tree structure
- information theoretic
- index structure
- computational complexity
- binary tree
- tree structures
- approximation algorithms
- tree models
- tree construction
- emerging patterns
- phase transition
- genetic algorithm
- error bounds
- np complete
- worst case
- r tree
- leaf nodes
- hierarchical structure
- approximation error
- approximation methods
- np hard
- tree nodes
- low degree