A. Feldmann

activity

20112026

most citedA

(1 + ε)

-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs

23 citations · 66 across the 21 of their papers we have counts for

collaborators

Showing 2017 · cs.DSShow all

3 papers · 2 filters

cs.DS2017★ 9 cited

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

Pavel Dvořák, Andreas Emil Feldmann, Dušan Knop +3

We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensive…

cs.DS2017★ 11 cited

The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems

Andreas Emil Feldmann, Daniel Marx

Given a directed graph $G$ and a list $(s_{1}, t_{1}), \dots, (s_{d}, t_{d})$ of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of $G$ that contains a di…

cs.DS2017★ 1 cited

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi

The Directed Steiner Network (DSN) problem takes as input a directed edge-weighted graph $G = (V, E)$ and a set $D \subseteq V \times V$ of $k$ demand pairs. The aim is to com…