Daniel Dadush gave a talk on a strongly polynomial-time algorithm to solve linear programming problems with at most two non-zero entries per each row or each column at the Discrete Math Seminar

On January 27, 2025, Daniel Dadush from CWI gave a talk at the Discrete Math Seminar on a strongly polynomial-time algorithm solve linear programming problems with at most two non-zero entries per each row or each column. The title of his talk was “A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column“.