HIGHLIGHTS
- who: Stephan Helfrich from the Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str14, Kaiserslautern, Germany have published the research: An approximation algorithm for a general class of multi-parametric optimization problems, in the Journal: (JOURNAL)
- what: The authors propose an approximation method that is applicable to a general class of optimization problems and outputs a set of solutions with cardinality polynomial in the instance size and the inverse of the approximation guarantee. For simplicity, the authors focus on minimization problems, but all the reasoning and results can be applied to maximization problems as well . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.