Efficiently computing succinct trade-off curves
From MaRDI portal
Publication:2581275
Recommendations
Cites work
- A simple efficient approximation scheme for the restricted shortest path problem
- A threshold of ln n for approximating set cover
- An improved FPTAS for Restricted Shortest Path.
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Database Theory - ICDT 2005
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1128781 (Why is no real title available?)
- scientific article; zbMATH DE number 1757943 (Why is no real title available?)
- Many birds with one stone
- Multicriteria optimization
- On the hardness of approximating minimization problems
Cited in
(26)- 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
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- An approximation algorithm for a general class of multi-parametric optimization problems
- Approximate tradeoffs on weighted labeled matroids
- Decision-making based on approximate and smoothed Pareto curves
- A general approximation method for bicriteria minimization problems
- How good is the Chord algorithm?
- Efficient optimization of many objectives by approximation-guided evolution
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Approximate tradeoffs on matroids
- scientific article; zbMATH DE number 1086945 (Why is no real title available?)
- scientific article; zbMATH DE number 1830716 (Why is no real title available?)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- On Geometric Set Cover for Orthants
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Covers and approximations in multiobjective optimization
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- Automata, Languages and Programming
- Algorithms and Computation
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
- Approximating biobjective minimization problems using general ordering cones
- Approximating multiobjective optimization problems: how exact can you be?
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
This page was built for publication: Efficiently computing succinct trade-off curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581275)
