The following pages link to Jan Vondrák (Q185367):
Displaying 18 items.
- Submodular function maximization via the multilinear relaxation and contention resolution schemes (Q5419149) (← links)
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Q5429267) (← links)
- Limitations of Randomized Mechanisms for Combinatorial Auctions (Q5495028) (← links)
- (Q5501356) (← links)
- Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems (Q5741731) (← links)
- Communication Complexity of Combinatorial Auctions with Submodular Valuations (Q5741796) (← links)
- Online submodular welfare maximization: Greedy is optimal (Q5741797) (← links)
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5895002) (← links)
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5902164) (← links)
- Optimization via enumeration: A new algorithm for the max cut problem (Q5935710) (← links)
- The limit checker number of a graph (Q5937947) (← links)
- On the hardness of dominant strategy mechanism design (Q6083523) (← links)
- On complex roots of the independence polynomial (Q6396168) (← links)
- Secretary Problems: The Power of a Single Sample (Q6408266) (← links)
- A simple proof of the nonuniform Kahn-Kalai conjecture (Q6573004) (← links)
- Fixed-price approximations in bilateral trade (Q6575194) (← links)
- Submodular optimization in the MapReduce model (Q6593574) (← links)
- Faster submodular maximization for several classes of matroids (Q6638077) (← links)
