Browsing Modern Aspects of Submodularity by Issue Date
Now showing items 1-20 of 27
-
Submodular Function Optimization in Sensor and Social Networks II
(Georgia Institute of Technology, 2012-03-19)Many applications in sensor and social networks involve discrete optimization problems. In recent years, it was discovered that many such problems have submodular structure. These problems include optimal sensor placement, ... -
Multi-commodity Flows and Cuts in Polymatroidal Networks
(arxiv.org/abs/1110.6832, 2012-03-19) -
Submodular Function Optimization in Sensor and Social Networks
(Georgia Institute of Technology, 2012-03-19)Many applications in sensor and social networks involve discrete optimization problems. In recent years, it was discovered that many such problems have submodular structure. These problems include optimal sensor placement, ... -
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 ... -
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/ ... -
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 ... -
Optimization of Submodular Functions: Tutorial - Lecture I
(2012-04-23) -
Introduction to Discrete Convex Analysis
(2012-04-23) -
Exploiting Submodularity to Tame Information Overload
(2012-04-23) -
New and Improved Bounds for the Minimum Set Cover Problem
(2012-04-23) -
Online Stochastic Matching Problem
(2012-04-23) -
Online Matching and Adwords
(2012-04-23) -
Optimization of Submodular Functions: Tutorial - lecture II
(2012-04-23) -
Maximum Entropy Sampling
(2012-04-23) -
Submodularity and the Complexity of Constraint Satisfaction
(2012-04-23) -
Submodular minimization in combinatorial problems
(2012-04-23)