Presents an O(n^4 log n) time and O(n) space algorithm for maximizing the weight of points in the symmetric difference of two axis-aligned rectangles over n weighted points in the plane.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Maximum-Weight Two Boxes Symmetric Difference Problem
Presents an O(n^4 log n) time and O(n) space algorithm for maximizing the weight of points in the symmetric difference of two axis-aligned rectangles over n weighted points in the plane.