@InProceedings{bringmann_et_al:LIPIcs.SoCG.2017.22,
author = {Bringmann, Karl and Cabello, Sergio and Emmerich, Michael T. M.},
title = {{Maximum Volume Subset Selection for Anchored Boxes}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.22},
URN = {urn:nbn:de:0030-drops-72011},
doi = {10.4230/LIPIcs.SoCG.2017.22},
annote = {Keywords: geometric optimization, subset selection, hypervolume indicator, Klee’s 23 measure problem, boxes, NP-hardness, PTAS}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode