Pages that link to "Item:Q2448119"
From MaRDI portal
The following pages link to Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119):
Displaying 13 items.
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- Planar maximum-box problem revisited (Q1749536) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Dynamic minimum bichromatic separating circle (Q2424884) (← links)
- Hierarchical Design of Fast Minimum Disagreement Algorithms (Q2835623) (← links)
- Dynamic Minimum Bichromatic Separating Circle (Q3467880) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- (Q5091023) (← links)
- Minimum membership covering and hitting (Q5918296) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
