Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
Yefim DinitzMichael ElkinShay SolomonPublished in: CoRR (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- decision trees
- lower and upper bounds
- lower bounding
- objective function
- worst case
- optimal solution
- quadratic assignment problem
- information extraction
- np hard
- euclidean space
- search algorithm
- set of randomly generated instances
- upper and lower bounds
- vc dimension
- euclidean distance
- randomly generated problems
- online algorithms
- question answering
- tree models
- optimal cost
- deep knowledge
- natural language processing