An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems

09/21/2021
by   Stephan Helfrich, et al.
0

In a widely studied class of multi-parametric optimization problems, the objective value of each solution is an affine function of real-valued parameters. For many important multi-parametric optimization problems, an optimal solutions set with minimum cardinality can contain super-polynomially many solutions. Consequently, any exact algorithm for such problems must output a super-polynomial number of solutions. We propose an approximation algorithm that is applicable to a general class of multi-parametric optimization problems and outputs a number of solutions that is bounded polynomially in the instance size and the inverse of the approximation guarantee. This method lifts approximation algorithms for non-parametric optimization problems to their parametric formulations, providing an approximation guarantee that is arbitrarily close to the approximation guarantee for the non-parametric problem. If the non-parametric problem can be solved exactly in polynomial time or if an FPTAS is available, the method yields an FPTAS. We discuss implications to important multi-parametric combinatorial optimizations problems. Remarkably, we obtain a (3/2 + ε)-approximation algorithm for the multi-parametric metric travelling salesman problem, whereas the non-parametric version is known to be APX-complete. Furthermore, we show that the cardinality of a minimal size approximation set is in general not ℓ-approximable for any natural number ℓ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2023

Approximating Multiobjective Optimization Problems: How exact can you be?

It is well known that, under very weak assumptions, multiobjective optim...
research
05/18/2021

Approximate solutions of convex semi-infinite optimization problems in finitely many iterations

We develop two adaptive discretization algorithms for convex semi-infini...
research
05/28/2018

Strongly polynomial efficient approximation scheme for segmentation

Partitioning a sequence of length n into k coherent segments is one of t...
research
03/24/2022

Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs

This paper studies a variant of the minimum-cost flow problem in a graph...
research
08/28/2019

One-Exact Approximate Pareto Sets

Papadimitriou and Yannakakis show that the polynomial-time solvability o...
research
03/09/2021

PGD-based advanced nonlinear multiparametric regressions for constructing metamodels at the scarce-data limit

Regressions created from experimental or simulated data enable the const...
research
08/03/2019

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems

We determine the power of the weighted sum scalarization with respect to...

Please sign up or login with your details

Forgot password? Click here to reset