Settling the Approximability of Submodular Facility Location
2 versions
BN
Bento Natura
math.OCcs.DScs.DMmath.COcs.CG
On Valency
published · living versionsPreprints & journals
10 papers in the corpus · 2019–2026Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time
0 citations
Circuit Diameter of Polyhedra is Strongly Polynomial
0 citations
Interior point methods are not worse than Simplex
8 citations
A Faster Interior-Point Method for Sum-of-Squares Optimization
4 citations
The Pareto cover problem
0 citations
On Circuit Diameter Bounds via Circuit Imbalances
4 citations
Circuit imbalance measures and linear programming
1 citation
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
18 citations
An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems
3 citations
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
16 citations
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in beta. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.