1 citations · 1 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.OC2019
Packing under Convex Quadratic Constraints
Max Klimm, Marc E. Pfetsch, Rico Raber +1
We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-fa…
cs.DS2019
Travelling on Graphs with Small Highway Dimension
Yann Disser, Andreas Emil Feldmann, Max Klimm +1
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] a…