Cookies?
Library Header Image
LSE Research Online LSE Library Services

Items where Author is "Végh, László A."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 58.

Article

Koh, Zhuan Khye, Husic, Edin ORCID: 0000-0002-6708-5112, Loho, Georg and Végh, László A. ORCID: 0000-0003-1152-200X (2024) On the correlation gap of matroids. Mathematical Programming. ISSN 0025-5610 (In Press)

Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2024) On circuit diameter bounds via circuit imbalances. Mathematical Programming. ISSN 0025-5610 (In Press)

Fujishige, Satoru, Kitahara, Tomonari and Végh, László A. ORCID: 0000-0003-1152-200X (2024) An update-and-stabilize framework for the minimum-norm-point problem. Mathematical Programming. ISSN 0025-5610

Garg, Jugal, Husić, Edin and Végh, László A. ORCID: 0000-0003-1152-200X (2023) An auction algorithm for market equilibrium with weak gross substitute demands. ACM Transactions on Economics and Computation, 11 (3-4). 1 - 24. ISSN 2167-8375

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2023) An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. Mathematics of Operations Research, 48 (4). 1934 - 1958. ISSN 0364-765X

Dadush, Daniel, Huiberts, Sophie, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2023) A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Mathematical Programming. ISSN 0025-5610

Garg, Jugal and Végh, László A. ORCID: 0000-0003-1152-200X (2023) A strongly polynomial algorithm for linear exchange markets. Operations Research, 71 (2). 487 - 505. ISSN 0030-364X

Orlin, James B. and Végh, László A. ORCID: 0000-0003-1152-200X (2023) Directed shortest paths via approximate cost balancing. Journal of the ACM, 70 (1). ISSN 0004-5411

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2021) Geometric rescaling algorithms for submodular function minimization. Mathematics of Operations Research, 46 (3). 1081 - 1108. ISSN 0364-765X

Svensson, Ola, Tarnawski, Jakub and Végh, László A. ORCID: 0000-0003-1152-200X (2020) A constant-factor approximation algorithm for the asymmetric traveling salesman problem. Journal of the ACM, 67 (6). ISSN 0004-5411

Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2020) A simpler and faster strongly polynomial algorithm for generalized flow maximization. Journal of the ACM, 67 (2). ISSN 0004-5411

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2020) Rescaling algorithms for linear conic feasibility. Mathematics of Operations Research, 45 (2). 732 - 754. ISSN 0364-765X

Svensson, Ola, Tarnawski, Jakub and Végh, László A. ORCID: 0000-0003-1152-200X (2018) Constant factor approximation for ATSP with two edge weights. Mathematical Programming, 172 (1-2). pp. 371-397. ISSN 0025-5610

Singh, Mohit and Végh, László A. ORCID: 0000-0003-1152-200X (2018) Approximating minimum cost connectivity orientation and augmentation. SIAM Journal on Computing, 47 (1). pp. 270-293. ISSN 0097-5397

Devanur, Nikhil R., Garg, Jugal and Végh, László A. ORCID: 0000-0003-1152-200X (2016) A rational convex program for linear Arrow-Debreu markets. ACM Transactions on Economics and Computation, 5 (1). p. 6. ISSN 2167-8375

Végh, László A. ORCID: 0000-0003-1152-200X (2016) A strongly polynomial algorithm for generalized flow maximization. Mathematics of Operations Research, 42 (1). pp. 179-211. ISSN 0364-765X

Végh, László A. ORCID: 0000-0003-1152-200X (2016) A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. SIAM Journal on Computing, 45 (5). pp. 1729-1761. ISSN 0097-5397

Chandrasekaran, Karthekeyan, Végh, László A. ORCID: 0000-0003-1152-200X and Vempala, Santosh S. (2016) The cutting plane method is polynomial for perfect matchings. Mathematics of Operations Research, 41 (1). pp. 23-48. ISSN 0364-765X

Mnich, Matthias, Williams, Virginia Vassilevska and Végh, László A. ORCID: 0000-0003-1152-200X (2016) A 7/3-approximation for feedback vertex sets in tournaments. Leibniz International Proceedings in Informatics (57). 67:1-67:14. ISSN 1868-8969

Marx, Dániel and Végh, László A. ORCID: 0000-0003-1152-200X (2015) Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. ACM Transactions on Algorithms, 11 (4). p. 27. ISSN 1549-6325

Végh, László A. ORCID: 0000-0003-1152-200X and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2015) Oriented Euler complexes and signed perfect matchings. Mathematical Programming, 150 (1). pp. 153-178. ISSN 0025-5610

Piliouras, Georgios, Valla, Tomáš and Végh, László A. ORCID: 0000-0003-1152-200X (2014) LP-based covering games with low price of anarchy. Theory of Computing Systems, 57 (1). pp. 238-260. ISSN 1432-4350

Végh, László A. ORCID: 0000-0003-1152-200X (2014) Concave generalized flows with applications to market equilibria. Mathematics of Operations Research, 39 (2). pp. 573-596. ISSN 0364-765X

Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2014) A polynomial projection-type algorithm for linear programming. Operations Research Letters, 42 (1). pp. 91-96. ISSN 0167-6377

Cheriyan, Joseph and Végh, László A. ORCID: 0000-0003-1152-200X (2014) Approximating minimum-cost -node connected subgraphs via independence-free graphs. SIAM Journal on Computing, 43 (4). pp. 1342-1362. ISSN 0097-5397

Frank, András and Végh, László A. ORCID: 0000-0003-1152-200X (2008) An algorithm to increase the node-connectivity of a digraph by one. Discrete Optimization, 5 (4). pp. 677-684. ISSN 1572-5286

Végh, László A. ORCID: 0000-0003-1152-200X and Benczúr, András A. (2008) Primal-dual approach for directed vertex connectivity augmentation and generalizations. ACM Transactions on Algorithms, 4 (2). 20:1-20:21. ISSN 1549-6325

Book Section

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2024) A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. In: Mohar, Bojan, Shinkar, Igor and O�Donnell, Ryan, (eds.) STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC ’24), June 24–28. Proceedings of the Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 1561 – 1572. ISBN 9798400703836

Cole, Richard, Hertrich, Christoph ORCID: 0000-0001-5646-8567, Tao, Yixin and Végh, László A. ORCID: 0000-0003-1152-200X (2024) A first order method for linear programming parameterized by circuit imbalance. In: Vygen, Jens and Byrka, Jarosław, (eds.) Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, pp. 57-70. ISBN 9783031598340

Garg, Jugal, Husić, Edin ORCID: 0000-0002-6708-5112, Li, Wenzheng, Végh, László A. ORCID: 0000-0003-1152-200X and Vondrák, Jan (2023) Approximating Nash social welfare by matching and local search. In: Saha, Barna and Servedio, Rocco A., (eds.) STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, pp. 1298-1310. ISBN 9781450399135

Husić, Edin ORCID: 0000-0002-6708-5112, Koh, Zhuan Khye, Loho, Georg and Végh, László A. ORCID: 0000-0003-1152-200X (2023) On the correlation gap of matroids. In: Del Pia, Alberto and Kaibel, Volker, (eds.) Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, pp. 203-216. ISBN 9783031327254

Fujishige, Satoru, Kitahara, Tomonari and Végh, László A. ORCID: 0000-0003-1152-200X (2023) An update-and-stabilize framework for the minimum-norm-point problem. In: Del Pia, Alberto and Kaibel, Volker, (eds.) Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, pp. 142-156. ISBN 9783031327254

Orlin, James B. and Végh, László A. ORCID: 0000-0003-1152-200X (2022) Directed shortest paths via approximate cost balancing. In: Marx, Daniel, (ed.) ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, 235 - 254. ISBN 9781611976465

Garg, Jugal, Tao, Yixin and Végh, László A. ORCID: 0000-0003-1152-200X (2022) Approximating equilibrium under constrained piecewise linear concave utilities with applications to matching markets. In: Naor, Joseph (Seffi) and Buchbinder, Niv, (eds.) Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2269 - 2284. ISBN 9781611977073

Husić, Edin, Loho, Georg, Smith, Ben and Végh, László A. ORCID: 0000-0003-1152-200X (2022) On complete classes of valuated matroids. In: Naor, Joseph (Seffi) and Buchbinder, Niv, (eds.) Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 945 - 962. ISBN 9781611977073

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2022) On finding exact solutions of linear programs in the oracle model. In: Naor, Joseph (Seffi) and Buchbinder, Niv, (eds.) Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2700 - 2722. ISBN 9781611977073

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2021) An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. In: Mutzel, Petra, Pagh, Rasmus and Herman, Grzegorz, (eds.) 29th Annual European Symposium on Algorithms, ESA 2021. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772044

Garg, Jugal, Husić, Edin and Végh, László A. ORCID: 0000-0003-1152-200X (2021) Approximating Nash social welfare under rado valuations. In: Khuller, Samir and Williams, Virginia Vassilevska, (eds.) STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, ITA, 1412 - 1425. ISBN 9781450380539

Garg, Jugal, Husić, Edin ORCID: 0000-0002-6708-5112 and Végh, László A. ORCID: 0000-0003-1152-200X (2021) Auction algorithms for market equilibrium with weak gross substitute demands and their applications. In: Blaser, Markus and Monmege, Benjamin, (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021. Leibniz International Proceedings in Informatics, LIPIcs,187. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959771801

Dadush, Daniel, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2020) Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers. In: Proceedings of The 61st Annual Symposium on Foundations of Computer Science (FOCS 2020), November 16-19. IEEE Computer Society, pp. 931-942.

Dadush, Daniel, Huiberts, Sophie, Natura, Bento and Végh, László A. ORCID: 0000-0003-1152-200X (2020) A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. In: Makarychev, Konstantin, Makarychev, Yury, Tulsiani, Madhur, Kamath, Gautam and Chuzhoy, Julia, (eds.) STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, USA, pp. 761-774. ISBN 9781450369794

Loho, Georg and Végh, László A. ORCID: 0000-0003-1152-200X (2020) Signed tropical convexity. In: Vidick, Thomas, (ed.) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl, Leibniz-Zentrum für Informatik, USA. ISBN 9783959771344

Garg, Jugal and Végh, László A. ORCID: 0000-0003-1152-200X (2019) A strongly polynomial algorithm for linear exchange markets. In: Charikar, Moses and Cohen, Edith, (eds.) STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing. UNSPECIFIED, pp. 54-65. ISBN 9781450367059

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2018) Geometric rescaling algorithms for submodular function minimization. In: Czumaj, Artur, (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings. Society for Industrial and Applied Mathematics, Philadelphia, USA, pp. 832-848. ISBN 978-611975031

Svensson, Ola, Tarnawski, Jakub and Végh, László A. ORCID: 0000-0003-1152-200X (2018) A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC’18). Association for Computing Machinery, New York, NY, pp. 204-213. ISBN 9781450355599

Ene, Alina, Nguyen, Huy and Végh, László A. ORCID: 0000-0003-1152-200X (2017) Decomposable submodular function minimization: discrete and continuous. In: Guyon, I., Luxburg, U. V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S. and Garnett, R., (eds.) Advances in Neural Information Processing Systems 30 (NIPS 2017) pre-proceedings. Neural Information Processing Systems Foundation, Long Beach, USA.

Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2017) A simpler and faster strongly polynomial algorithm for generalized flow maximization. In: STOC: ACM Symposium on Theory of Computing. ACM Press, 100 - 111. ISBN 9781450345286

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2016) Rescaled coordinate descent methods for linear programming. In: Louveaux, Quentin and Skutella, Martin, (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, Cham, Switzerland, pp. 26-37. ISBN 9783319334608

Végh, László A. ORCID: 0000-0003-1152-200X (2013) Concave generalized flows with applications to market equilibria. In: Proceedings of the IEEE 53rd Symposium on Foundations of Computer Science (Focs) 2012. IEEE Computer Society, pp. 150-159.

Marx, Dániel and Végh, László A. ORCID: 0000-0003-1152-200X (2013) Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. In: Fomin, Fedor V., Freivalds, Rūsiņš, Kwiatkowska, Marta and Peleg, David, (eds.) Automata, Languages, and Programming: 40th International Colloquium, Icalp 2013, Riga, Latvia, July 8-12, 2013. Lecture notes in computer science (7965). Springer Berlin / Heidelberg, Berlin, pp. 721-732. ISBN 9783642392054

Chandrasekaran, Karthekeyan, Végh, László A. ORCID: 0000-0003-1152-200X and Vempala, Santosh (2013) The cutting plane method is polynomial for perfect matchings. In: Proceedings of the IEEE 53rd Symposium on Foundations of Computer Science (Focs) 2012. IEEE Computer Society, pp. 571-580.

Conference or Workshop Item

Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2017) A simpler and faster strongly polynomial algorithm for generalized flow maximization. In: STOC 2017 Theory Fest: 49th Annual ACM Symposium on the Theory of Computing, 2017-06-19 - 2017-06-23, Hyatt Regency, Montreal, Montreal, Canada, CAN.

Singh, Mohit and Végh, László A. ORCID: 0000-0003-1152-200X (2014) Approximating minimum cost connectivity orientation and augmentation. In: SODA 2014 - ACM-SIAM Symposium on Discrete Algorithms, 2014-01-05 - 2014-01-07, Oregon, United States, USA.

Cheriyan, Joseph and Végh, László A. ORCID: 0000-0003-1152-200X (2013) Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: FOCS 2013 - 54th Annual Symposium on Foundations of Computer Science, 2013-10-27 - 2013-10-29, Berkeley CA, United States, USA.

Bérczi, Kristóf, Csikvári, Péter, Kovács, Erika Renáta and Végh, László A. ORCID: 0000-0003-1152-200X (2013) Splitting property via shadow systems. In: 8th Japanese Hungarian Symposium on Discrete Mathematics and its Applications, 2013-06-04 - 2013-06-07, Veszprem, Hungary, HUN.

Piliouras, Georgios, Valla, Tomas and Végh, László A. ORCID: 0000-0003-1152-200X (2012) LP-based Covering Games with Low Price of Anarchy. In: WINE 2012 - Workshop on Internet & Network Economics, 2012-12-01, Liverpool, United Kingdom, GBR.

Bérczi, Kristóf and Végh, László A. ORCID: 0000-0003-1152-200X (2010) Restricted b-matchings in degree-bounded graphs. In: The 14th Conference on Integer Programming & Combinatorial Optimization (IPCO XIV), 2010-06-09 - 2010-06-11, Lausanne, Switzerland, CHE.

Harks, Tobias and Végh, László A. ORCID: 0000-0003-1152-200X (2007) Nonadaptive selfish routing with online demands. In: Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), 2007-08-14, Halifax, Canada, CAN.

This list was generated on Mon Jul 15 06:23:04 2024 BST.