László A. Végh
László A. Végh
Bestätigte E-Mail-Adresse bei lse.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
LA Végh
SIAM Journal on Computing 45 (5), 1729-1761, 2016
602016
Augmenting undirected node-connectivity by one
LA Végh
SIAM Journal on Discrete Mathematics 25 (2), 695-718, 2011
442011
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
O Svensson, J Tarnawski, LA Végh
Journal of the ACM (JACM) 67 (6), 1-53, 2020
312020
Concave generalized flows with applications to market equilibria
LA Végh
Mathematics of Operations Research 39 (2), 573-596, 2014
282014
Approximating Minimum-Cost -Node Connected Subgraphs via Independence-Free Graphs
J Cheriyan, LA Végh
SIAM Journal on Computing 43 (4), 1342-1362, 2014
272014
A strongly polynomial algorithm for generalized flow maximization
LA Végh
Mathematics of Operations Research 42 (1), 179-211, 2017
252017
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation
D Marx, LA Végh
ACM Transactions on Algorithms (TALG) 11 (4), 1-24, 2015
242015
A rational convex program for linear Arrow-Debreu markets
NR Devanur, J Garg, LA Végh
ACM Transactions on Economics and Computation (TEAC) 5 (1), 1-13, 2016
202016
On mimicking networks representing minimum terminal cuts
A Khan, P Raghavendra
Information Processing Letters 114 (7), 365-371, 2014
202014
Nonadaptive selfish routing with online demands
T Harks, LA Végh
Workshop on Combinatorial and Algorithmic Aspects of Networking, 27-45, 2007
182007
A 7/3-approximation for feedback vertex sets in tournaments
M Mnich, VV Williams, LA Végh
arXiv preprint arXiv:1511.01137, 2015
172015
Primal-dual approach for directed vertex connectivity augmentation and generalizations
LA Végh, AA Benczúr
ACM Transactions on Algorithms (TALG) 4 (2), 20, 2008
172008
Restricted b-Matchings in Degree-Bounded Graphs
K Bérczi, LA Végh
International Conference on Integer Programming and Combinatorial …, 2010
162010
A simpler and faster strongly polynomial algorithm for generalized flow maximization
N Olver, LA Végh
Journal of the ACM (JACM) 67 (2), 1-26, 2020
142020
The cutting plane method is polynomial for perfect matchings
K Chandrasekaran, LA Végh, SS Vempala
Mathematics of Operations Research 41 (1), 23-48, 2016
142016
On submodular search and machine scheduling
R Fokkink, T Lidbetter, LA Végh
Mathematics of Operations Research 44 (4), 1431-1449, 2019
122019
Decomposable submodular function minimization: discrete and continuous
A Ene, H Nguyen, LA Végh
Advances in Neural Information Processing Systems, 2870-2880, 2017
122017
An algorithm to increase the node-connectivity of a digraph by one
A Frank, LA Végh
Discrete Optimization 5 (4), 677-684, 2008
112008
A polynomial projection-type algorithm for linear programming
LA Végh, G Zambelli
Operations Research Letters 42 (1), 91-96, 2014
102014
A strongly polynomial algorithm for linear exchange markets
J Garg, LA Végh
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
92019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20