Pascal Halffmann

Learn More
We present a general technique for approximating bicriteria minimization problems with positive-valued, polynomially computable objective functions. Given 0 < ǫ ≤ 1 and a polynomial-time α-approximation algorithm for the corresponding weighted sum problem, we show how to obtain a bicriteria (α · (1 + 2ǫ), α · (1+ 2 ǫ ))-approximation algorithm for the(More)
Multiobjective combinatorial optimization problems are known to be hard problems for two reasons: their decision versions are often NPcomplete and they are often intractable. Apart from this general observation, are there also variants or cases of multiobjective combinatorial optimization problems which are easy and, if so, what causes them to be easy? This(More)
  • 1