Abstract
AbstractPapadimitriou and Yannakakis (Proceedings of the 41st annual IEEE symposium on the Foundations of Computer Science (FOCS), pp 86–92, 2000) show that the polynomial-time solvability of a certain auxiliary problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $$(1+\varepsilon , \dots , 1+\varepsilon )$$
(
1
+
ε
,
⋯
,
1
+
ε
)
-approximate Pareto set (also called an $$\varepsilon $$
ε
-Pareto set). Similarly, in this article, we characterize the class of multiobjective optimization problems having a polynomial-time computable approximate $$\varepsilon $$
ε
-Pareto set that is exact in one objective by the efficient solvability of an appropriate auxiliary 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 optimization problems from this class, we provide an algorithm that computes a one-exact $$\varepsilon $$
ε
-Pareto set of cardinality at most twice the cardinality of a smallest such set and show that this factor of 2 is best possible. For three or more objective functions, however, we prove that no constant-factor approximation on the cardinality of the set can be obtained efficiently.
Funder
German Academic Exchange Service
Deutsche Forschungsgemeinschaft
Campus France
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference16 articles.
1. Angel, E., Bampis, E., Kononov, A.: A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA), LNCS, vol. 2161, pp. 194–205 (2001)
2. Angel, E., Bampis, E., Kononov, A.: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theor. Comput. Sci. 306, 319–338 (2003)
3. Bazgan, C., Jamain, F., Vanderpooten, D.: Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43(1), 1–6 (2015)
4. Bökler, F.: Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem. Ph.D. thesis, Technical University of Dortmund (2018)
5. Bökler, F., Ehrgott, M., Morris, C., Mutzel, P.: Output-sensitive complexity of multiobjective combinatorial optimization. J. Multi-Criteria Decis. Anal. 24(1–2), 25–36 (2017)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献