Browsing Modern Aspects of Submodularity by Title
Now showing items 1-20 of 27
-
Computing the Concave Closure of Discrete Concave Functions
(2012-04-23) -
Exploiting Submodularity to Tame Information Overload
(2012-04-23) -
Introduction to Discrete Convex Analysis
(2012-04-23) -
Introduction to Discrete Convex Analysis
(Georgia Institute of Technology, 2012-03-19)Discrete convex analysis is a theory that aims at a discrete analogue of convex analysis for nonlinear discrete optimization. Technically it is a nonlinear generalization of matroid/submodular function theory; matroids are ... -
Maximum Entropy Sampling
(2012-04-23) -
Minimization and Maximization Algorithms in Discrete Convex Analysis
(Georgia Institute of Technology, 2012-03-19)Discrete convex analysis is a theory that aims at a discrete analogue of convex analysis for nonlinear discrete optimization. Technically it is a nonlinear generalization of matroid/submodular function theory; matroids are ... -
Multi-commodity Flows and Cuts in Polymatroidal Networks
(arxiv.org/abs/1110.6832, 2012-03-19) -
New and Improved Bounds for the Minimum Set Cover Problem
(2012-04-23) -
Online Matching and Adwords
(2012-04-23) -
Online Stochastic Matching Problem
(2012-04-23) -
Optimization of Submodular Functions: Relaxations and Algorithms
(Georgia Institute of Technology, 2012-03-19)In this lecture, we cover the basic variants of optimization problems involving submodular functions, and known algorithms for solving them. Some particular problems that will be mentioned: the unconstrained minimization/ ... -
Optimization of Submodular Functions: Tutorial - Lecture I
(2012-04-23)