Title:
Minimization and Maximization Algorithms in Discrete Convex Analysis
Minimization and Maximization Algorithms in Discrete Convex Analysis
| dc.contributor.author | Murota, Kazuo | en_US |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Computer Science | en_US |
| dc.contributor.corporatename | University of Tokyo | en_US |
| dc.date.accessioned | 2012-04-12T18:44:30Z | |
| dc.date.available | 2012-04-12T18:44:30Z | |
| dc.date.issued | 2012-03-19 | |
| dc.description | Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodularity, March 19-22, 2012. | en_US |
| dc.description | Runtime: 52:29 minutes. | en_US |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 52:29 minutes | |
| dc.identifier.uri | http://hdl.handle.net/1853/43258 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.subject | Discrete convexity | en_US |
| dc.subject | Submodularity | en_US |
| dc.subject | Convexity | en_US |
| dc.title | Minimization and Maximization Algorithms in Discrete Convex Analysis | en_US |
| dc.type | Moving Image | |
| dc.type.genre | Lecture | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | Algorithms and Randomness Center | |
| local.contributor.corporatename | College of Computing | |
| local.relation.ispartofseries | Modern Aspects of Submodularity | |
| relation.isOrgUnitOfPublication | b53238c2-abff-4a83-89ff-3e7b4e7cba3d | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isSeriesOfPublication | b6799d88-f0fe-4101-9772-8f281d4bb42e |
Files
Original bundle
1 - 3 of 3
No Thumbnail Available
- Name:
- 05_murota.mp4
- Size:
- 151.7 MB
- Format:
- MP4 Video file
- Description:
- Download Video
No Thumbnail Available
- Name:
- 05murota_videostream.html
- Size:
- 985 B
- Format:
- Hypertext Markup Language
- Description:
- Streaming Video
No Thumbnail Available
- Name:
- Transcription.txt
- Size:
- 12 B
- Format:
- Plain Text
- Description:
- Transcription