Sascha Swiercy

Learn More
We consider an abstract class of optimization problems that are parameterized concavely in a single parameter, and show that the solution path along the parameter can always be approximated with accuracy ε > 0 by a set of sizeO(1/ √ ε). A lower bound of size Ω(1/ √ ε) shows that the upper bound is tight up to a constant factor. We also devise an algorithm(More)
  • 1