The Adaptive Complexity for Submodular Optimization
报告人:徐大川教授,北京工业大学 时间:2019年11月8日14:00--15:00
摘要:Balkanski and Singer (STOC'18) initiate the study of adaptivity (or parallelism) for maximizing a submdular function with a cardinality constraint. This work invokes subsequent improvements or extensions for submodular maximization with adaptive complexity.  In this talk,  we review these models, algorithms and complexities. We also introduce some open problems for future research.