Artículos con órdenes de acceso público - László A. VéghMás información
No disponible en ningún lugar: 1
An auction algorithm for market equilibrium with weak gross substitute demands
J Garg, E Husić, LA Végh
ACM Transactions on Economics and Computation 11 (3-4), 1-24, 2023
Órdenes: Swiss National Science Foundation, European Commission
Disponibles en algún lugar: 31
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
Órdenes: Swiss National Science Foundation, UK Engineering and Physical Sciences …
Augmenting undirected node-connectivity by one
LA Végh
Proceedings of the forty-second ACM symposium on Theory of computing, 563-572, 2010
Órdenes: Hungarian Scientific Research Fund
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
Órdenes: US National Science Foundation, European Commission
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation
D Marx, LA Végh
ACM Transactions on Algorithms (TALG) 11 (4), 1-24, 2015
Órdenes: Magyar Tudományos Akadémia, Hungarian Scientific Research Fund, European …
Approximating Nash social welfare under Rado valuations
J Garg, E Husić, LA Végh
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Órdenes: US National Science Foundation, European Commission
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
D Dadush, S Huiberts, B Natura, LA Végh
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Órdenes: European Commission
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
Órdenes: Netherlands Organisation for Scientific Research, UK Engineering and …
Restricted b-Matchings in Degree-Bounded Graphs
K Bérczi, LA Végh
International Conference on Integer Programming and Combinatorial …, 2010
Órdenes: Hungarian Scientific Research Fund
Geometric rescaling algorithms for submodular function minimization
D Dadush, LA Végh, G Zambelli
Mathematics of Operations Research 46 (3), 1081-1108, 2021
Órdenes: Netherlands Organisation for Scientific Research, UK Engineering and …
Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers
D Dadush, B Natura, LA Végh
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Órdenes: European Commission
On submodular search and machine scheduling
R Fokkink, T Lidbetter, LA Végh
Mathematics of Operations Research 44 (4), 1431-1449, 2019
Órdenes: UK Engineering and Physical Sciences Research Council
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
Órdenes: US National Science Foundation
Approximating nash social welfare by matching and local search
J Garg, E Husić, W Li, LA Végh, J Vondrák
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1298-1310, 2023
Órdenes: US National Science Foundation, Swiss National Science Foundation, European …
Rescaling algorithms for linear conic feasibility
D Dadush, LA Végh, G Zambelli
Mathematics of Operations Research 45 (2), 732-754, 2020
Órdenes: Netherlands Organisation for Scientific Research, UK Engineering and …
On circuit diameter bounds via circuit imbalances
D Dadush, ZK Koh, B Natura, LA Végh
International Conference on Integer Programming and Combinatorial …, 2022
Órdenes: European Commission
Constant factor approximation for ATSP with two edge weights
O Svensson, J Tarnawski, LA Végh
Mathematical Programming 172 (1), 371-397, 2018
Órdenes: UK Engineering and Physical Sciences Research Council, European Commission
An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems
D Dadush, ZK Koh, B Natura, LA Végh
Mathematics of Operations Research 48 (4), 1934-1958, 2023
Órdenes: European Commission
Interior point methods are not worse than Simplex
X Allamigeon, D Dadush, G Loho, B Natura, LA Végh
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Órdenes: European Commission
On complete classes of valuated matroids
E Husić, G Loho, B Smith, LA Végh
TheoretiCS 3, 2024
Órdenes: European Commission
La información de publicación y financiación se determina de forma automática mediante un programa informático