אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Submodular maximization captures both classical problems in combinatorial optimization and recent more practical applications that arise in other disciplines, e.g., machine learning and data mining. Typically, the size of the inputs in these applications is very large. Hence, it is interesting to devise algorithms that in addition to providing a provable guarantee on the quality of the output are also very fast and simple. In this talk we will focus on maximization of a submodular function given a cardinality constraint