A Tight Lower Bound for the Steiner Point Removal Problem on Trees.
T.-H. Hubert ChanDonglin XiaGoran KonjevodAndréa W. RichaPublished in: APPROX-RANDOM (2006)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- decision trees
- lower bounding
- objective function
- linear programming relaxation
- optimal solution
- np hard
- steiner tree
- machine learning
- upper and lower bounds
- sample complexity
- tree structure
- tree structures
- frequent patterns
- sample points
- dynamic programming
- neural network