• Corpus ID: 237581553

Approximating Biobjective Minimization Problems Using General Ordering Cones

  title={Approximating Biobjective Minimization Problems Using General Ordering Cones},
  author={Arne Herzel and Stephan Helfrich and Stefan Ruzika and Clemens Thielen},
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously considering α-approximations for all closed convex ordering cones of a fixed inner angle γ ∈ [π2 , π], an approximation guarantee between α and 2α is achieved, which depends continuously on γ. The analysis is best-possible for any inner angle and it generalizes… 
1 Citations

Figures from this paper

An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems
An approximation algorithm that is applicable to a general class of multi-parametric optimization problems and outputs a number of solutions that is bounded polynomially in the instance size and the inverse of the approximation guarantee is proposed.


A General Approximation Method for Bicriteria Minimization Problems
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems
The power of the weighted sum scalarization is determined with respect to the computation of approximations for general multiobjective minimization and maximization problems and a new multi-factor notion of approximation is introduced that is specifically tailored to the multiobjectives case and its inherent trade-offs between different objectives.
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
It is shown that for a broad class of biobjective problems, one can compute in polynomial time an $\epsilon$-Pareto set that contains at most twice as many solutions as the minimum set, and that the factor of 2 is tight for these problems.
Succinct approximate convex pareto curves
When an ε-CP can be constructed in polynomial time in terms of an efficient routine Comb for optimizing (exactly or approximately) monotone linear combinations of the objectives is characterized.
Approximation Methods for Multiobjective Optimization Problems: A Survey
This paper provides the first survey of this important area at the intersection of computing and operations research, which uses techniques and methods from algorithmics and computing to efficiently determine approximate solutions to many well-known multiobjective problems from operations research.
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
Although there is no universally accepted solution concept for decision problems with multiple noncommensurable objectives, one would agree that agood solution must not be dominated by the other
Approximate Pareto sets of minimal size for multi-objective optimization problems
On the approximability of trade-offs and optimal access of Web sources
These concepts and techniques are applied to formulate and solve approximately a cost-time-quality trade-off for optimizing access to the World-Wide Web, in a model first studied by Etzioni et al. (1996).
Hardness and Approximability in Multi-Objective Optimization
It is seen that in contrast to single-objective problems, where the solution notions coincide, the situation is more subtle for multiple objectives, so it is important to exactly specify the NP-hardness notion when discussing the complexity of multi-objectives problems.
Covers and approximations in multiobjective optimization
The concept of tolerance function is proposed as a tool for modeling representation quality and leads to the extension of the traditional dominance relation to $$t\hbox {-}$$t-dominance.