Maximum Volume Subset Selection for Anchored Boxes

Abstract

Let $B$ be a set of $n$ axis-parallel boxes in ${\mathbb{R}}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of ${\mathbb{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. This 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 running time in any dimension $d\ge 3$ is $\Omega \left(\right(\genfrac{}{}{0ex}{}{n}{k}\left)\right)$. We show that: - The problem is NP-hard already in 3 dimensions. - In 3 dimensions, we break the bound $\Omega \left(\right(\genfrac{}{}{0ex}{}{n}{k}\left)\right)$, by providing an $n^{O(\sqrt{k})}$ algorithm. - For any constant dimension $d$, we present an efficient polynomial-time approximation scheme.

Presented at SoCG'17. Full Version. 24 pages

Cited by in corpus (4)

• FPT Algorithms for Diverse Collections of Hitting Sets
• On the Unbounded External Archive and Population Size in Preference-based Evolutionary Multi-objective Optimization Using a Reference Point
• k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front
• Analyzing the Landscape of the Indicator-based Subset Selection Problem