One-Exact Approximate Pareto Sets
Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel, Vanderpooten

TL;DR
This paper characterizes when polynomial-time algorithms can compute approximate Pareto sets that are exact in one objective, focusing on multiobjective problems like shortest path and spanning tree, and provides algorithms with optimal bounds for biobjective cases.
Contribution
It establishes a link between singleobjective problem solvability and approximate Pareto set computation, and introduces algorithms with optimal size bounds for biobjective problems.
Findings
Polynomial-time computability of approximate Pareto sets depends on singleobjective problem solvability.
Provides a 2-approximation algorithm for biobjective problems with optimal size bounds.
Shows no constant-factor approximation is possible for three or more objectives.
Abstract
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit a polynomial-time computable -approximate Pareto set (also called an -Pareto set). Similarly, in this article, we characterize the class of problems having a polynomial-time computable approximate -Pareto set that is exact in one objective by the efficient solvability of an appropriate singleobjective problem. This class includes important problems such as multiobjective shortest path and spanning tree, and the approximation guarantee we provide is, in general, best possible. Furthermore, for biobjective problems from this class, we provide an algorithm that computes a one-exact -Pareto set of cardinality at most twice the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
