activity
20192026
most citedComplexity of Scheduling Few Types of Jobs on Related and Unrelated Machines

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

collaborators
Showing math.OCShow all

1 paper · 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…