Depth Lower Bounds in Stabbing Planes for Combinatorial Principles.
Stefan S. DantchevNicola GalesiAbdul GhaniBarnaby MartinPublished in: STACS (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- three dimensional
- objective function
- branch and bound
- depth map
- depth information
- lower and upper bounds
- lower bounding
- worst case
- d objects
- optimal solution
- vc dimension
- quadratic assignment problem
- upper and lower bounds
- linear programming relaxation
- polynomial approximation