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

Authors:
Cristina Bazgan;Laurent Gourvès;Jérôme Monnot
Affiliations:
LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France and CNRS, UMR 7243, France and Institut Universitaire de France, France;LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France and CNRS, UMR 7243, France;LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France and CNRS, UMR 7243, France
Venue:
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Year:
2011

Citing 18
Cited 0

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

Operations Research
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
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
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
(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 biobjective optimization problems with a given number of solutions. This task is relevant for two reasons: (i) Pareto sets are often computationally hard so approximation is a necessary tradeoff to allow polynomial time algorithms; (ii) limiting explicitly the size of the approximation allows the decision maker to control the expected accuracy of approximation and prevents him to be overwhelmed with too many alternatives. 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 Bisection, Max Partition, Max Set Splitting and Max Matching.