A Lower Bound on Greedy Embedding in Euclidean Plane.
Lei CaoAndrew StrelzoffJonathan Z. SunPublished in: GPC (2010)
Keyphrases
- euclidean plane
- lower bound
- upper bound
- greedy algorithm
- greedy heuristic
- objective function
- branch and bound algorithm
- branch and bound
- np hard
- search algorithm
- lower bounding
- lower and upper bounds
- optimal solution
- worst case
- feature selection
- locally optimal
- vector space
- upper and lower bounds
- linear programming relaxation
- dynamic programming
- robust image watermarking
- forward selection
- sufficiently accurate
- greedy strategy
- constant factor
- greedy algorithms
- online algorithms
- data hiding
- sample complexity
- hill climbing
- search space
- data structure