activity
20062022
most citedTractable Fragments of the Maximum Nash Welfare Problem

8 citations · 10 across the 11 of their papers we have counts for

collaborators
Showing 2019 · math.OCShow all

1 paper · 2 filters

math.OC2019

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Daniel Dadush, Sophie Huiberts, Bento Natura +1

Following the breakthrough work of Tardos in the bit-complexity model, Vavasis and Ye gave the first exact algorithm for linear programming in the real model of computation with ru…