Jan Vondrak and Optimization - Free people check

(1 - 9 from 10

)

Yaron Singer | publications

people.seas.harvard.edu

Information-theoretic Lower Bounds for Convex Optimization with Erroneous Oracles with Jan Vondrak Annual Conference on Neural Information Processing ...

Related courses

people.seas.harvard.edu

Convex and Combinatorial Optimization, Shaddin Dughmi, USC; Polyhedral Techniques in Combinatorial Optimization, Jan Vondrak, Stanford; Mathematical ...

Jan Vondrak, IBM Almaden | Operations Research and ...

orfe.princeton.edu

Jan Vondrak, IBM Almaden . Algorithms for Optimization of Submodular Functions. Tue Sep :30 PM to 5:30 PM. Sherrerd Hall 101; Colloquia; All Upcoming Events.

Jan Vondrak's publications

theory.stanford.edu

Maxim Sviridenko, Jan Vondrak, Justin Ward: Optimal approximation for submodular and supermodular optimization with bounded curvature in SODA

Vondrak, Jan | econcs

econcs.seas.harvard.edu

Yaron Singer and Jan Vondrak “Information-theoretic Lower Bounds for Convex Optimization with Erroneous Oracles.” In Annual Conference on Neural ...

Approximation, Randomization, and Combinatorial Optimization....

books.google.cz

This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems,...

[ ] Symmetry and approximability of submodular maximization...

arxiv.org

Authors: Jan Vondrak. (Submitted on 21 Oct (v1), last revised 30 Jan (this version, v2)). Abstract: A number of recent results on optimization problems involving submodular functions have made use of the multilinear relaxation of the problem. These results hold typically in the value oracle model, where the ...