Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Finding minimal convex nested polygons
Information and Computation
How to net a lot with little: small &egr;-nets for disks and halfspaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Separation and approximation of polyhedral objects
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Multiobjective query optimization
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for Polytope Covering and Approximation
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
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
Sensitivity analysis for combinatorial optimization
Sensitivity analysis for combinatorial optimization
The complexity of some problems in parametric linear and combinatorial programming
The complexity of some problems in parametric linear and combinatorial programming
Multicriteria Optimization
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Approximately dominating representatives
Theoretical Computer Science
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Multi-objective model checking of Markov decision processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Markov decision processes with multiple objectives
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Understanding the meaning of a shifted sky: a general framework on extending skyline query
The VLDB Journal — The International Journal on Very Large Data Bases
How good is the Chord algorithm?
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Supervised design space exploration by compositional approximation of Pareto sets
Proceedings of the 48th Design Automation Conference
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
Pareto curves for probabilistic model checking
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Efficient design space exploration for component-based system design
Proceedings of the International Conference on Computer-Aided Design
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
Hi-index | 0.00 |
We study the succinct approximation of convex Pareto curves of multiobjective optimization problems. We propose the concept of ε-convex Pareto (ε-CP) set as the appropriate one for the convex setting, and observe that it can offer arbitrarily more compact representations than ε-Pareto sets in this context. We characterize when an ε-CP can be constructed in polynomial time in terms of an efficient routine Comb for optimizing (exactly or approximately) monotone linear combinations of the objectives. We investigate the problem of computing minimum size ε-convex Pareto sets, both for discrete (combinatorial) and continuous (convex) problems, and present general algorithms using a Comb routine. For bi-objective problems, we show that if we have an exact Comb optimization routine, then we can compute the minimum ε-CP for continuous problems (this applies for example to bi-objective Linear Programming and Markov Decision Processes), and factor 2 approximation to the minimum ε-CP for discrete problems (this applies for example to bi-objective versions of polynomial-time solvable combinatorial problems such as Shortest Paths, Spanning Tree, etc.). If we have an approximate Comb routine, then we can compute factor 3 and 6 approximations respectively to the minimum ε-CP for continuous and discrete bi-objective problems. We consider also the case of three and more objectives and present some upper and lower bounds.