Vegh, Laszlo A.

1. Strongly polynomial algorithm for a class of minimum-cost flow problems\n with separable convex objectives
   2011/10/21 by László A. Végh, Vegh, Laszlo A. · 2 citations
   Computer Science · Economics, Econometrics and Finance · Mathematics · #Complexity and Algorithms in Graphs #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Economic theories and models #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods #Optimization and Search Problems
2. Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
   2012/12/17 by Cheriyan, Joseph, Vegh, Laszlo A. · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
3. Approximating Nash Social Welfare under Rado Valuations
   2020/09/30 by Garg, Jugal, Husic, Edin, Vegh, Laszlo A. · 1 citation
   #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Multiagent Systems (cs.MA) #Optimization and Control (math.OC)