Bökler, Fritz and Ehrgott, Matthias and Morris, Christopher and Mutzel, Petra (2017) Output-sensitive complexity of multiobjective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 24 (1-2). pp. 25-36. ISSN 1057-9214
main.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.
Download (691kB)
Abstract
We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general enumeration problem is regarded efficient if it is output-sensitive, i.e., its running time is bounded by a polynomial in the input and the output size. We provide both practical examples of MOCO problems for which such an efficient algorithm exists as well as problems for which no efficient algorithm exists under mild complexity theoretic assumptions.