The maximum hypervolume set yields near-optimal approximation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
How good is the Chord algorithm?
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Pareto efficiency and approximate pareto efficiency in routing and load balancing games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Supervised design space exploration by compositional approximation of Pareto sets
Proceedings of the 48th Design Automation Conference
A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations
INFORMS Journal on Computing
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation-guided evolutionary multi-objective optimization
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Efficiency-revenue trade-offs in auctions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The new faces of combinatorial optimization
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Approximation quality of the hypervolume indicator
Artificial Intelligence
A fast approximation-guided evolutionary multi-objective algorithm
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A study on the stability and efficiency of graphical games with unbounded treewidth
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy $\epsilon$ the Pareto curve of a multiobjective optimization problem. We show that for a broad class of biobjective problems (containing many important widely studied problems such as shortest paths, spanning tree, matching, and many others), we can compute in polynomial time an $\epsilon$-Pareto set that contains at most twice as many solutions as the minimum set. Furthermore we show that the factor of 2 is tight for these problems; i.e., it is NP-hard to do better. We present upper and lower bounds for three or more objectives, as well as for the dual problem of computing a specified number $k$ of solutions which provide a good approximation to the Pareto curve.