Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

DOI10.1137/080724514zbMath1198.90346MaRDI QIDQ3586183

Mihalis Yannakakis, Ilias Diakonikolas

Publication date: 6 September 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080724514

zbMATH Keywords

multiobjective optimization; approximate Pareto set; biobjective shortest path

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

68W25: Approximation algorithms

Related Items

Unnamed Item, Approximation Methods for Multiobjective Optimization Problems: A Survey, Unnamed Item, Obtaining approximately optimal and diverse solutions via dispersion, Approximating biobjective minimization problems using general ordering cones, Computational social choice for coordination in agent networks, Efficient optimization of many objectives by approximation-guided evolution, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, Covers and approximations in multiobjective optimization, Stochastic convergence of random search methods to fixed size Pareto front approximations, Finding representations for an unconstrained bi-objective combinatorial optimization problem, Discrete representation of the non-dominated set for multi-objective optimization problems using kernels, Reference points and approximation algorithms in multicriteria discrete optimization, Approximate Pareto sets of minimal size for multi-objective optimization problems, One-exact approximate Pareto sets, Costs and rewards in priced timed automata, The power of the weighted sum scalarization for approximating multiobjective optimization problems, Advancing local search approximations for multiobjective combinatorial optimization problems, A general approximation method for bicriteria minimization problems, How Good is the Chord Algorithm?, Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games