Suchergebnisse
Suchergebnisse:
Jan Vondrák (IBM Almaden) Submodular Optimization Tutorial 3 / 1 Combinatorial optimization There are many problems that we study in combinatorial optimization...
- 588KB
- 65
Jan Vondrak's homepage. Professor of Mathematics. Dept. of Mathematics Stanford University 450 Jane Lanthrop Way, building 380 Stanford, CA 94305 E-mail: jvondrak-at-stanford-dot-edu. Research interests. Discrete optimization. Matroids and submodular functions. Approximation algorithms. Algorithmic game theory. Probabilistic combinatorics.
Jan Vondrák is a Czech applied mathematician and theoretical computer scientist. He has been a professor of mathematics at Stanford University since 2015. He was a research staff member in the theory group at the IBM Almaden Research Center from 2009 to 2015.
Jan Vondrák, Chandra Chekuri, Rico Zenklusen: Submodular function maximization via the multilinear relaxation and contention resolution schemes. STOC 2011 : 783-792
9. Juli 2010 · Submodular Maximization by Simulated Annealing. Shayan Oveis Gharan, Jan Vondrák. We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints.
Department of Mathematics Building 380, Stanford, California 94305 Phone: (650) 725-6284 mathfrontdesk [at] stanford.edu (E-mail)