vix.ing · top · new · best · stats · spec

Vondrák, Jan

  1. Submodular Function Maximization via the Multilinear Relaxation and\n Contention Resolution Schemes
    2011/05/23 by Chandra Chekuri, Chekuri, Chandra, Jan Vondrák +4 · 10 citations
    Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Optimization and Packing Problems
  2. Optimal approximation for submodular and supermodular optimization with bounded curvature
    2013/11/19 by Sviridenko, Maxim, Vondrák, Jan, Ward, Justin · 5 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  3. On complex roots of the independence polynomial
    2022/04/11 by Ferenc Bencs, Bencs, Ferenc, Péter Csíkvári +5 · 4 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Commutative Algebra and Its Applications #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Polynomial and algebraic computation
  4. Submodular Maximization by Simulated Annealing
    2010/07/09 by Shayan Oveis Gharan, Gharan, Shayan Oveis, Jan Vondrák +1 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  5. Multiway Cut, Pairwise Realizable Distributions, and Descending\n Thresholds
    2013/09/11 by Ankit Sharma, J. Vondrák, Sharma, Ankit +1 · 2 citations
    Engineering · Computer Science · #Optimization and Packing Problems #Complexity and Algorithms in Graphs #Optimization and Search Problems
  6. Approximating Nash Social Welfare by Matching and Local Search
    2022/11/07 by Garg, Jugal, Husić, Edin, Li, Wenzheng +2 · 3 citations
    #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  7. On the Hardness of Dominant Strategy Mechanism Design
    2022/06/01 by Dobzinski, Shahar, Ron, Shiri, Vondrák, Jan · 2 citations
    #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences
  8. Secretary Problems: The Power of a Single Sample
    2022/08/19 by Pranav Nuti, Nuti, Pranav, Jan Vondrák +1 · 2 citations
    Computer Science · Decision Sciences · #Auction Theory and Applications #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems #Probability (math.PR)
  9. Towards an Optimal Contention Resolution Scheme for Matchings
    2022/11/07 by Pranav Nuti, Jan Vondrák, Nuti, Pranav +1 · 2 citations
    Computer Science · #Cooperative Communication and Network Coding #Complexity and Algorithms in Graphs #Cryptography and Data Security
  10. A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations
    2021/03/18 by Wenzheng Li, Li, Wenzheng, J. Vondrák +1 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Computer Science and Game Theory (cs.GT) #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  11. Fixed-Price Approximations in Bilateral Trade
    2021/07/29 by Kang, Zi Yang, Pernice, Francisco, Vondrák, Jan · 1 citation
    #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences