A better lower bound for Lower-Left Anchored Rectangle Packing.
Ruben HoeksmaMatthew MaatPublished in: CoRR (2021)
Keyphrases
- lower bound
- maximum profit
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- np hard
- worst case
- lower and upper bounds
- optimal solution
- upper and lower bounds
- packing problem
- significantly lower
- line segments
- image processing
- knapsack problem
- sample complexity
- vc dimension
- minimum bounding
- hough transform
- linear programming relaxation
- competitive ratio
- search algorithm