scientific article; zbMATH DE number 5764846

MaRDI QIDQ3579439zbMATH OpenFDO

Authors Ilias Diakonikolas, Mihalis Yannakakis

Publication date 6 August 2010

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Analysis of algorithms and problem complexity (68Q25)

Cited in

(13)

• How good is the Chord algorithm?
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
• An approximation algorithm for a general class of multi-parametric optimization problems
• The power of the weighted sum scalarization for approximating multiobjective optimization problems
• An FPTAS for optimizing a class of low-rank functions over a polytope
• Reference points and approximation algorithms in multicriteria discrete optimization
• Optimal eviction policies for stochastic address traces
• Approximating biobjective minimization problems using general ordering cones
• An approximation algorithm for a general class of parametric optimization problems
• Probabilistic automata of bounded ambiguity
• Multicriteria decision making
• Probabilistic automata of bounded ambiguity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579439)