A. Feldmann

activity

20122022

most citedImproving the H_k-Bound on the Price of Stability in Undirected Shapley Network Design Games

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018

Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics

Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic

We consider the classic Facility Location, $k$ -Median, and $k$ -Means problems in metric spaces of doubling dimension $d$ . We give nearly linear-time approximation schemes for each…

cs.CC2018

The Parameterized Hardness of the k-Center Problem in Transportation Networks

Andreas Emil Feldmann, Daniel Marx

In this paper we study the hardness of the $k$ -Center problem on inputs that model transportation networks. For the problem, a graph $G = (V, E)$ with edge lengths and an integer $k$ …