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

Authors:
Cristina Bazgan;Laurent Gourvès;Jérôme Monnot
Affiliations:
PSL, Université Paris-Dauphine, LAMSADE, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France and CNRS, UMR 7243, France and Institut Universitaire de France, France;CNRS, UMR 7243, France and PSL, Université Paris-Dauphine, LAMSADE, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France;CNRS, UMR 7243, France and PSL, Université Paris-Dauphine, LAMSADE, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France
Venue:
Journal of Discrete Algorithms
Year:
2013

Citing 22
Cited 0

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
On the k-coloring of intervals

Discrete Applied Mathematics
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Approximability of maximum splitting of k-sets and some other Apx-complete problems

Information Processing Letters
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results

Journal of the ACM (JACM)
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Finding Dense Subgraphs with Semidefinite Programming

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems

WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

Theoretical Computer Science
Approximating Multiobjective Knapsack Problems

Management Science
Multicriteria Optimization

Multicriteria Optimization
Approximation algorithms for the bi-criteria weighted MAX-CUT problem

Discrete Applied Mathematics
Maximizing Non-Monotone Submodular Functions

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Non-monotone submodular maximization under matroid and knapsack constraints

Proceedings of the forty-first annual ACM symposium on Theory of computing
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
On approximating multicriteria TSP

ACM Transactions on Algorithms (TALG)
(Non)-approximability for the multi-criteria TSP(1, 2)

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Multiobjective optimization: improved FPTAS for shortest paths and non-linear objectives with applications

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A polynomial-time approximation scheme for maximizing the minimum machine completion time

Operations Research Letters
On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.