Chen, Xi, and Peng, Binghui. On the complexity of dynamic submodular maximization. Retrieved from https://par.nsf.gov/biblio/10345275. Proceedings of the 54th ACM Symposium on Theory of Computing (STOC 22') . Web. doi:10.1145/3519935.3519951.
Chen, Xi, & Peng, Binghui. On the complexity of dynamic submodular maximization. Proceedings of the 54th ACM Symposium on Theory of Computing (STOC 22'), (). Retrieved from https://par.nsf.gov/biblio/10345275. https://doi.org/10.1145/3519935.3519951
@article{osti_10345275,
place = {Country unknown/Code not available},
title = {On the complexity of dynamic submodular maximization},
url = {https://par.nsf.gov/biblio/10345275},
DOI = {10.1145/3519935.3519951},
abstractNote = {},
journal = {Proceedings of the 54th ACM Symposium on Theory of Computing (STOC 22')},
author = {Chen, Xi and Peng, Binghui},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.