Travelled to:1 × Latvia
3 × USA
Collaborated with:∅ D.Marx
Talks about:algorithm (3) polynomi (2) minimum (2) connect (2) augment (2) strong (2) flow (2) cost (2) undirect (1) problem (1)
Person: László A. Végh
DBLP: V=eacute=gh:L=aacute=szl=oacute=_A=
Contributed to:
2014
201320122010Wrote 4 papers:
- STOC-2014-Vegh #algorithm #polynomial
- A strongly polynomial algorithm for generalized flow maximization (LAV), pp. 644–653.
- ICALP-v1-2013-MarxV #algorithm #parametricity
- Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation (DM, LAV), pp. 721–732.
- STOC-2012-Vegh #algorithm #low cost #polynomial #problem
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (LAV), pp. 27–40.
- STOC-2010-Vegh
- Augmenting undirected node-connectivity by one (LAV), pp. 563–572.