Approximation with a fixed number of solutions of some multiobjective maximization problems

Cristina Bazgan (1) , Laurent Gourvès (1) , Jérôme Monnot (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

We investigate the problem of approximating the Pareto set of some multiobjective optimization problems with a given number of solutions. Our purpose is to exploit general properties that many well studied problems satisfy. We derive existence and constructive approximation results for the biobjective versions of Max Submodular Symmetric Function (and special cases), Max Bisection, and Max Matching and also for the k-objective versions of Max Coverage, Heaviest Subgraph, Max Coloring of interval graphs.

Mots clés: Submodular functions; Multiobjective maximization problems; Approximation; Bisection; Coverage; Matching

Domaines: Informatique [cs]

Cristina Bazgan, Laurent Gourvès, Jérôme Monnot. Approximation with a fixed number of solutions of some multiobjective maximization problems. Journal of Discrete Algorithms, 2013, 22, ⟨10.1016/j.jda.2013.06.006⟩. ⟨hal-01505564⟩