A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Maximum Volume Subset Selection for Anchored Boxes
unpublished
Let B be a set of n axis-parallel boxes in R d such that each box has a corner at the origin and the other corner in the positive quadrant of R d , and let k be a positive integer. We study the problem of selecting k boxes in B that maximize the volume of the union of the selected boxes. The research is motivated by applications in skyline queries for databases and in multicriteria optimization, where the problem is known as the hypervolume subset selection problem. It is known that the problem
fatcat:y4pxqnlj65fq5o3cdl63gg5mba