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 math.OCShow all

2 papers · 1 filter

math.OC2020

A Note on the Approximability of Deepest-Descent Circuit Steps

Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann +1

Linear programs (LPs) can be solved by polynomially many moves along the circuit direction improving the objective the most, so-called deepest-descent steps (dd-steps). Computing t…

math.OC2016

Fast Approximation Algorithms for the Generalized Survivable Network Design Problem

Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich +1

In a standard -connectivity network design problem, we are given an undirected graph , a cut-requirement function , and non-negative cos…