10 citations · 15 across the 2 of their papers we have counts for
4 papers
Computational Aspects of the Hausdorff Distance in Unbounded Dimension
Stefan König
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matc…
Sharpening Geometric Inequalities using Computable Symmetry Measures
René Brandenberg, Stefan König
Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (to…
Fixed Parameter Complexity and Approximability of Norm Maximization
Christian Knauer, Stefan König, Daniel Werner
The problem of maximizing the -th power of a -norm over a halfspace-presented polytope in is a convex maximization problem which plays a fundamental role in computatio…
No dimension independent Core-Sets for Containment under Homothetics
Rene Brandenberg, Stefan Koenig
This paper deals with the containment problem under homothetics which has the minimal enclosing ball (MEB) problem as a prominent representative. We connect the problem to results…