Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares.
Jallu, Vahideh Keikha, Maarten Löffler, and Maria Saumell
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
-
Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares.