Series
Modern Aspects of Submodularity

Permanent Link
https://hdl.handle.net/1853/70936
Series Type
Event Series
Description
Associated Organization(s)
Associated Organization(s)
Organizational Unit
Organizational Unit

Filters
2012 4
2 2
2 2
4
Reset filters

Settings
Author: Murota, Kazuo × Has files: Yes ×

Publication Search Results

Now showing 1 - 4 of 4
Thumbnail Image
Item

Introduction to Discrete Convex Analysis

2012-04-23 , Murota, Kazuo

View
No Thumbnail Available
Item

Minimization and Maximization Algorithms in Discrete Convex Analysis

2012-03-19 , Murota, Kazuo

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 generalized to M-convex functions and submodular set functions to L-convex function.This talk consists of two parts: In the first part fundamental concepts and theorems in discrete convex analysis are explained with reference to familiar combinatorial optimization problems like minimum spanning tree, shortest path, and matching. In view of the recent development in submodular function maximization, minimization and maximization algorithms in discrete convex analysis are explained in the second part of the talk. In particular, M-natural concave functions form a subclass of submodular functions that can be maximized in polynomial time.

View
Thumbnail Image
Item

Minimization and Maximization Algorithms in Discrete Convex Analysis

2012-04-23 , Murota, Kazuo

View
No Thumbnail Available
Item

Introduction to Discrete Convex Analysis

2012-03-19 , Murota, Kazuo

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 generalized to M-convex functions and submodular set functions to L-convex function.This talk consists of two parts: In the first part fundamental concepts and theorems in discrete convex analysis are explained with reference to familiar combinatorial optimization problems like minimum spanning tree, shortest path, and matching. In view of the recent development in submodular function maximization, minimization and maximization algorithms in discrete convex analysis are explained in the second part of the talk. In particular, M-natural concave functions form a subclass of submodular functions that can be maximized in polynomial time.

View