A Tight Lower Bound for Planar Steiner Orientation.
Rajesh ChitnisAndreas Emil FeldmannOndrej SuchýPublished in: Algorithmica (2019)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound
- branch and bound algorithm
- worst case
- lower bounding
- optimal solution
- surface patches
- objective function
- lagrangian relaxation
- upper and lower bounds
- linear programming relaxation
- position and orientation
- planar surfaces
- geometrical properties
- curved surfaces
- lower and upper bounds
- sample complexity
- competitive ratio
- projective geometry
- planar graphs