Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Abstract

In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated solutions in the resulting sets. In this article, we consider the task of computing the Pareto sum of two given Pareto sets A,B of size n. The Pareto sum C contains all non-dominated points of the Minkowski sum M={a+b|a∈A,b∈B}. Since the Minkowski sum has a size of n^2, but the Pareto sum C can be much smaller, the goal is to compute C without having to compute and store all of M. We present several new algorithms for efficient Pareto sum computation, including an output-sensitive successive algorithm with a running time of O(nlogn+nk) and a space consumption of O(n+k) for k=|C|. If the elements of C are streamed, the space consumption reduces to O(n). For output sizes k≥2n, we prove a conditional lower bound for Pareto sum computation, which excludes running times in O(n^(2−δ)) for δ>0 unless the (min,+)-convolution hardness conjecture fails. The successive algorithm matches this lower bound for k∈Θ(n). However, for k∈Θ(n^2), the successive algorithm exhibits a cubic running time. But we also present an algorithm with an output-sensitive space consumption and a running time of O(n^2logn), which matches the lower bound up to a logarithmic factor even for large k. Furthermore, we describe suitable engineering techniques to improve the practical running times of our algorithms. Finally, we provide an extensive comparative experimental study on generated and real-world data. As a showcase application, we consider preprocessing-based bi-criteria route planning in road networks.