Jan Vondrák
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
2011/01/01 by Gruia Calinescu, Gruiă Cälinescu, Chandra Chekuri +3 · 70 citations
Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Cryptography and Data Security
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
2014/01/01 by Chandra Chekuri, Jan Vondrák, J. Vondrák +1 · 24 citations
Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Computational Geometry and Mesh Generation
- Submodular Function Maximization via the Multilinear Relaxation and\n Contention Resolution Schemes
2011/05/23 by Chandra Chekuri, Chekuri, Chandra, Jan Vondrák +4 · 11 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
- 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
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
2013/07/12 by Vitaly Feldman, Feldman, Vitaly, Jan Vondrák +1 · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Imbalanced Data Classification Techniques #Machine Learning (cs.LG) #Machine Learning and Algorithms
- Limitations of randomized mechanisms for combinatorial auctions
2011/09/06 by Shaddin Dughmi, Dughmi, Shaddin, Jan Vondrák +1 · 3 citations
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Game Theory and Voting Systems #Optimization and Search Problems
- Is submodularity testable?
2010/08/04 by C. Seshadhri, Seshadhri, C., Jan Vondrák +1 · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #semigroups and automata theory
- 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)
- 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
- Methods for obtaining more complete species lists in surveys of lichen biodiversity
2016/05/12 by Jan Vondrák, Jiří Malíček, Zdeněk Palice +5 · 1 citation