1 citations · 1 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
FPT Inapproximability of Directed Cut and Connectivity Problems
Rajesh Chitnis, Andreas Emil Feldmann
(see paper for full abstract) Cut problems and connectivity problems on digraphs are two well-studied classes of problems from the viewpoint of parameterized complexity. After a se…
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…