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

Number of items: 60.
Article
  • A 7/3-approximation for feedback vertex sets in tournaments. Mnich, Matthias and Williams, Virginia Vassilevska and Végh, László A.
  • Approximating minimum cost connectivity orientation and augmentation. Singh, Mohit and Végh, László A.
  • Approximating minimum-cost -node connected subgraphs via independence-free graphs. Cheriyan, Joseph and Végh, László A.
  • Concave generalized flows with applications to market equilibria. Végh, László A.
  • Constant factor approximation for ATSP with two edge weights. Svensson, Ola and Tarnawski, Jakub and Végh, László A.
  • Directed shortest paths via approximate cost balancing. Orlin, James B. and Végh, László A. picture_as_pdf
  • Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. Marx, Dániel and Végh, László A.
  • Geometric rescaling algorithms for submodular function minimization. Dadush, Daniel and Végh, László A. and Zambelli, Giacomo picture_as_pdf
  • Interior point methods are not worse than simplex. Allamigeon, Xavier and Dadush, Daniel and Loho, Georg and Natura, Bento and Végh, László A. picture_as_pdf
  • LP-based covering games with low price of anarchy. Piliouras, Georgios and Valla, Tomáš and Végh, László A.
  • On circuit diameter bounds via circuit imbalances. Koh, Zhuan Khye and Natura, Bento and Végh, László A. picture_as_pdf
  • On the correlation gap of matroids. Koh, Zhuan Khye and Husic, Edin and Loho, Georg and Végh, László A. picture_as_pdf
  • Oriented Euler complexes and signed perfect matchings. Végh, László A. and von Stengel, Bernhard
  • Primal-dual approach for directed vertex connectivity augmentation and generalizations. Végh, László A. and Benczúr, András A.
  • Rescaling algorithms for linear conic feasibility. Dadush, Daniel and Végh, László A. and Zambelli, Giacomo picture_as_pdf
  • An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. Dadush, Daniel and Koh, Zhuan Khye and Natura, Bento and Végh, László A. picture_as_pdf
  • An algorithm to increase the node-connectivity of a digraph by one. Frank, András and Végh, László A.
  • An auction algorithm for market equilibrium with weak gross substitute demands. Garg, Jugal and Husić, Edin and Végh, László A.
  • A constant-factor approximation algorithm for the asymmetric traveling salesman problem. Svensson, Ola and Tarnawski, Jakub and Végh, László A. picture_as_pdf
  • The cutting plane method is polynomial for perfect matchings. Chandrasekaran, Karthekeyan and Végh, László A. and Vempala, Santosh S.
  • A polynomial projection-type algorithm for linear programming. Végh, László A. and Zambelli, Giacomo
  • A rational convex program for linear Arrow-Debreu markets. Devanur, Nikhil R. and Garg, Jugal and Végh, László A.
  • A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Dadush, Daniel and Huiberts, Sophie and Natura, Bento and Végh, László A. picture_as_pdf
  • A simpler and faster strongly polynomial algorithm for generalized flow maximization. Olver, Neil and Végh, László A. picture_as_pdf
  • A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. Végh, László A.
  • A strongly polynomial algorithm for generalized flow maximization. Végh, László A.
  • A strongly polynomial algorithm for linear exchange markets. Garg, Jugal and Végh, László A. picture_as_pdf
  • An update-and-stabilize framework for the minimum-norm-point problem. Fujishige, Satoru and Kitahara, Tomonari and Végh, László A. picture_as_pdf
    • Chapter
  • A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. (2024) Dadush, Daniel and Koh, Zhuan Khye and Natura, Bento and Olver, Neil and Végh, László A. picture_as_pdf
  • Approximating Nash social welfare by matching and local search. Garg, Jugal and Husić, Edin and Li, Wenzheng and Végh, László A. and Vondrák, Jan
  • Approximating Nash social welfare under rado valuations. Garg, Jugal and Husić, Edin and Végh, László A. picture_as_pdf
  • Approximating competitive equilibrium by Nash welfare. Garg, Jugal and Tao, Yixin and Végh, László A.
  • Approximating equilibrium under constrained piecewise linear concave utilities with applications to matching markets. Garg, Jugal and Tao, Yixin and Végh, László A. picture_as_pdf
  • Auction algorithms for market equilibrium with weak gross substitute demands and their applications. Garg, Jugal and Husić, Edin and Végh, László A. picture_as_pdf
  • Concave generalized flows with applications to market equilibria. Végh, László A.
  • Decomposable submodular function minimization: discrete and continuous. Ene, Alina and Nguyen, Huy and Végh, László A.
  • Directed shortest paths via approximate cost balancing. Orlin, James B. and Végh, László A. picture_as_pdf
  • Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. Marx, Dániel and Végh, László A.
  • Geometric rescaling algorithms for submodular function minimization. Dadush, Daniel and Végh, László A. and Zambelli, Giacomo picture_as_pdf
  • On complete classes of valuated matroids. Husić, Edin and Loho, Georg and Smith, Ben and Végh, László A. picture_as_pdf
  • On finding exact solutions of linear programs in the oracle model. Dadush, Daniel and Végh, László A. and Zambelli, Giacomo picture_as_pdf
  • On the correlation gap of matroids. Husić, Edin and Koh, Zhuan Khye and Loho, Georg and Végh, László A.
  • Rescaled coordinate descent methods for linear programming. Dadush, Daniel and Végh, László A. and Zambelli, Giacomo
  • Revisiting Tardos's framework for linear programming:faster exact solutions using approximate solvers. Dadush, Daniel and Natura, Bento and Végh, László A. picture_as_pdf
  • Signed tropical convexity. Loho, Georg and Végh, László A. picture_as_pdf
  • An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. Dadush, Daniel and Koh, Zhuan Khye and Natura, Bento and Végh, László A. picture_as_pdf
  • A constant-factor approximation algorithm for the asymmetric traveling salesman problem. Svensson, Ola and Tarnawski, Jakub and Végh, László A. picture_as_pdf
  • The cutting plane method is polynomial for perfect matchings. Chandrasekaran, Karthekeyan and Végh, László A. and Vempala, Santosh
  • A first order method for linear programming parameterized by circuit imbalance. Cole, Richard and Hertrich, Christoph and Tao, Yixin and Végh, László A.
  • A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Dadush, Daniel and Huiberts, Sophie and Natura, Bento and Végh, László A. picture_as_pdf
  • A simpler and faster strongly polynomial algorithm for generalized flow maximization. Olver, Neil and Végh, László A.
  • A strongly polynomial algorithm for linear exchange markets. Garg, Jugal and Végh, László A. picture_as_pdf
  • An update-and-stabilize framework for the minimum-norm-point problem. Fujishige, Satoru and Kitahara, Tomonari and Végh, László A.
    • Conference or Workshop Item
  • Approximating minimum cost connectivity orientation and augmentation. Singh, Mohit and Végh, László A.
  • Approximating minimum-cost k-node connected subgraphs via independence-free graphs. Cheriyan, Joseph and Végh, László A.
  • LP-based Covering Games with Low Price of Anarchy. Piliouras, Georgios and Valla, Tomas and Végh, László A.
  • Nonadaptive selfish routing with online demands. Harks, Tobias and Végh, László A.
  • Restricted b-matchings in degree-bounded graphs. Bérczi, Kristóf and Végh, László A.
  • Splitting property via shadow systems. Bérczi, Kristóf and Csikvári, Péter and Kovács, Erika Renáta and Végh, László A.
  • A simpler and faster strongly polynomial algorithm for generalized flow maximization. Olver, Neil and Végh, László A.