Name
Abstract | ||
|---|---|---|
Let B be a set of n axis-parallel boxes in d-dimensions such that each box has a corner at the origin and the other corner in the positive quadrant, 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 can be solved in polynomial time in the plane, while the best known algorithms in any dimension du003e2 enumerate all size-k subsets. We show that:* The problem is NP-hard already in 3 dimensions.* In 3 dimensions, we break the enumeration of all size-k subsets, by providing an n^O(sqrt(k)) algorithm.* For any constant dimension d, we give an efficient polynomial-time approximation scheme. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.4230/LIPIcs.SoCG.2017.22 | Symposium on Computational Geometry |
DocType | Volume | Citations |
Journal | abs/1803.00849 | 2 |
PageRank | References | Authors |
0.35 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karl Bringmann | 1 | 427 | 30.13 |
| Sergio Cabello | 2 | 30 | 4.90 |
| Michael Emmerich | 3 | 1243 | 71.89 |