László A. Végh

activity

20112026

most citedDecomposable Submodular Function Minimization: Discrete and Continuous

15 citations · 42 across the 16 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.OC2016

Rescaling Algorithms for Linear Conic Feasibility

Daniel Dadush, László A. Végh, Giacomo Zambelli

We propose simple polynomial-time algorithms for two linear conic feasibility problems. For a matrix $A \in R^{m \times n}$ , the kernel problem requires a positive vector in…

cs.DS2016

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization

Neil Olver, László A. Végh

We present a new strongly polynomial algorithm for generalized flow maximization that is significantly simpler and faster than the previous strongly polynomial algorithm [Végh16].…