ARC Submodularity Workshop

Workshop Theme:
Submodular functions are discrete analogues of convex functions, arising in various fields of computer science and operations research. Since the seminal work of Jack Edmonds (1970), submodularity has long been recognized as a common structure of many efficiently solvable combinatorial optimization problems. Recent algorithmic developments in the past decade include combinatorial strongly polynomial algorithm for minimization, constant factor approximation algorithms for maximization, and efficient methods for learning submodular functions. In addition, submodular functions find novel applications in combinatorial auctions, machine learning, and social networks. This workshop aims at providing a forum for researchers from a variety of backgrounds for exchanging results, ideas, and problems on submodular optimization and its applications. The first day will be devoted to tutorial-style lectures!

 Poster [PDF] 

Complete Details

Videos of all the tutorial sessions:

See all workshop presentations and videos

Event Details


  • Monday, March 19, 2012
    9:00 am - Thursday, March 22, 2012
    4:00 pm
Location: Klaus 1116, Georgia Tech, Atlanta GA