Bento Natura

According to our database, Bento Natura authored at least 10 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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

Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh

Math. Program., March, 2024

2023

Global Interconnect Optimization.

Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter

ACM Trans. Design Autom. Electr. Syst., September, 2023

A Faster Interior-Point Method for Sum-of-Squares Optimization.

Shunhua Jiang, Bento Natura, Omri Weinstein

Algorithmica, September, 2023

2022

On Circuit Diameter Bounds via Circuit Imbalances.

Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Interior point methods are not worse than Simplex.

Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

The Pareto Cover Problem.

Bento Natura, Meike Neuwohner, Stefan Weltge

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Circuit imbalance measures and linear programming.

Farbod Ekbatani, Bento Natura, László A. Végh

CoRR, 2021

An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems.

Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality.

Zhuan Khye Koh, Bento Natura, László A. Végh

CoRR, 2020

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers.

Daniel Dadush, Bento Natura, László A. Végh

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020