Maximum volume subset selection for anchored boxes

DOI10.4230/LIPICS.SOCG.2017.22MaRDI QIDQ4580096zbMATH OpenFDO

Authors Karl Bringmann, S. Cabello, Michael Emmerich

Publication date 13 August 2018

Full work available at URL https://arxiv.org/abs/1803.00849

zbMATH Keywords

boxesgeometric optimizationhypervolume indicatorKlee's measure problemNP-hardnessPTASsubset selection

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• On the largest empty axis-parallel box amidst \(n\) points
• Planar maximum box problem
• The maximum box problem and its application to data analysis
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Computing Klee's measure of grounded boxes

Cited in

(6)

• Implicit enumeration strategies for the hypervolume subset selection problem
• Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
• Exact hypervolume subset selection through incremental computations
• Computing representations using hypervolume scalarizations
• Maximizing dominance in the plane and its applications
• Many-objective quality measures

This page was built for publication: Maximum volume subset selection for anchored boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580096)