scientific article; zbMATH DE number 5764846

zbMATH Open1192.90190MaRDI QIDQ3579439FDOQ3579439

Authors: Ilias Diakonikolas, Mihalis Yannakakis 

Publication date: 6 August 2010

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (13)

• The power of the weighted sum scalarization for approximating multiobjective optimization problems
• Probabilistic automata of bounded ambiguity
• Multicriteria decision making
• 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 parametric optimization problems
• An approximation algorithm for a general class of multi-parametric optimization problems
• Reference points and approximation algorithms in multicriteria discrete optimization
• An FPTAS for optimizing a class of low-rank functions over a polytope
• Probabilistic Automata of Bounded Ambiguity
• Approximating biobjective minimization problems using general ordering cones
• Optimal eviction policies for stochastic address traces
• How good is the Chord algorithm?

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)