Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
430865 | Journal of Discrete Algorithms | 2013 | 11 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot,