Jan Vondrak
- Lazier Than Lazy Greedy
2014/09/28 by Baharan Mirzasoleiman, Mirzasoleiman, Baharan, Ashwinkumar Badanidiyuru +7 · 15 citations
Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Machine Learning (cs.LG) #cs.DS #cs.IR #cs.LG
- Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees
2013/04/02 by Vitaly Feldman, Feldman, Vitaly, Pravesh K. Kothari +5 · 6 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 #cs.CC #cs.DS #cs.LG
- A note on concentration of submodular functions
2010/05/17 by Jan Vondrak, Vondrak, Jan · 4 citations
Computer Science · #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.DM #cs.DS
- Dependent Randomized Rounding for Matroid Polytopes and Applications
2009/09/24 by Chandra Chekuri, Jan Vondrak, J. Vondrák +4 · 6 citations
Computer Science · #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 #cs.DM #cs.DS
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
2013/07/12 by Vitaly Feldman, Jan Vondrak, Jan Vondrák +2 · 5 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 #cs.CC #cs.DS #cs.LG
- Is submodularity testable?
2010/08/04 by C. Seshadhri, Jan Vondrak, Jan Vondrák +2 · 4 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #cs.DM #cs.DS #semigroups and automata theory
- Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions
2015/04/13 by Vitaly Feldman, Jan Vondrak, Jan Vondrák +3 · 3 citations
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning and Algorithms #Optimization and Search Problems #cs.DS #cs.LG
- The Computational Complexity of Truthfulness in Combinatorial Auctions
2012/02/13 by Shahar Dobzinski, Jan Vondrak, Jan Vondrák +2 · 2 citations
Computer Science · Decision Sciences · #Auction Theory and Applications #Complexity and Algorithms in Graphs #Computer Science and Game Theory (cs.GT) #Cryptography and Data Security #FOS: Computer and information sciences #cs.GT
- Online submodular welfare maximization: Greedy is optimal
2012/04/04 by Michael Kapralov, Kapralov, Michael, Ian Post +3 · 2 citations
Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS
- Limitations of randomized mechanisms for combinatorial auctions
2011/09/06 by Shaddin Dughmi, Jan Vondrak, Jan Vondrák +2 · 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 #cs.DS #cs.GT