J. Vondrák

Publications
Influence

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

G. Calinescu, C. Chekuri, M. Pál, J. Vondrák
Mathematics, Computer Science
SIAM J. Comput.
1 November 2011

An improved coating pan apparatus and spray arm assembly are disclosed for providing facilitated maintenance and cleaning of sensitive spray nozzles. Expand

Optimal approximation for the submodular welfare problem in the value oracle model

J. Vondrák
Mathematics, Computer Science
STOC '08
17 May 2008

We develop a randomized continuous greedy algorithm which achieves a (1-1/e)-approximation for the Submodular Welfare Problem in the value oracle model where the only access to the utility functions is through a black box returning wi(S) for a given set S. Expand

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

G. Calinescu, C. Chekuri, M. Pál, J. Vondrák
Mathematics, Computer Science
IPCO
25 June 2007

We show that the generalized assignment problem (GAP) is a special case of our problem; although the reduction requires |N| to be exponential in the original problem size, we obtain a (1 i¾? 1/e)-approximation for variants of GAP with more complex constraints. Expand

Fast algorithms for maximizing submodular functions

Ashwinkumar Badanidiyuru, J. Vondrák
Mathematics, Computer Science
SODA
5 January 2014

In this paper we develop algorithms that match the best known approximation guarantees, but with significantly improved running times, for maximizing a monotone submodular function subject to various constraints. Expand

Maximizing Non-monotone Submodular Functions

U. Feige, V. Mirrokni, J. Vondrák
Mathematics, Computer Science
SIAM J. Comput.
1 July 2011

In this paper, we design the first constant-factor approximation algorithms for maximizing nonnegative (non-monotone) submodular functions. Expand

Submodular maximization by simulated annealing

Shayan Oveis Gharan, J. Vondrák
Mathematics, Computer Science
SODA '11
9 July 2010

We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for the unconstrained… Expand

Lazier Than Lazy Greedy

Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, J. Vondrák, Andreas Krause
Computer Science
AAAI
28 September 2014

We develop the first linear-time algorithm for maximizing a general monotone submodular function subject to a cardinality constraint. Expand

Maximizing Non-Monotone Submodular Functions

U. Feige, V. Mirrokni, J. Vondrák
Computer Science
48th Annual IEEE Symposium on Foundations of…
2007

Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs, certain constraint satisfaction problems and maximum facility location problems. Expand

Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures

C. Chekuri, J. Vondrák, R. Zenklusen
Mathematics, Computer Science
IEEE 51st Annual Symposium on Foundations of…
23 October 2010

We consider the problem of randomly rounding a fractional solution $x$ in an integer polytope $P \subseteq [0,1]^n$ to a vertex $X$ of $P$, so that $\E[X] = x$. Expand

Submodular function maximization via the multilinear relaxation and contention resolution schemes

C. Chekuri, J. Vondrák, R. Zenklusen
Mathematics, Computer Science
STOC '11
23 May 2011

We consider the problem of maximizing a non-negative submodular set function f:2N -> RR+ over a ground set N subject to a variety of packing type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. Expand

Recommended Authors