scientific article; zbMATH DE number 6917041
DOI10.4230/LIPICS.SOCG.2017.22zbMATH Open1432.68496arXiv1803.00849MaRDI QIDQ4580096FDOQ4580096
S. Cabello, Michael Emmerich, Karl Bringmann
Publication date: 13 August 2018
Full work available at URL: https://arxiv.org/abs/1803.00849
Title of this publication is not available (Why is that?)
geometric optimizationNP-hardnessboxesPTASsubset selectionKlee's measure problemhypervolume indicator
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (5)
- Maximizing dominance in the plane and its applications
- Exact hypervolume subset selection through incremental computations
- Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
- Implicit enumeration strategies for the hypervolume subset selection problem
- Computing representations using hypervolume scalarizations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580096)
