Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Lin Chen 0003, Moran Feldman, Amin Karbasi. Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?. In Jennifer G. Dy, Andreas Krause 0001, editors, Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018. Volume 80 of JMLR Workshop and Conference Proceedings, pages 803-812, JMLR.org, 2018. [doi]

This author has not been identified. Look up 'Lin Chen 0003' in GoogleThis author has not been identified. Look up 'Moran Feldman' in GoogleThis author has not been identified. Look up 'Amin Karbasi' in Google

runs on WebDSL