On the complexity of dynamic submodular maximization

Xi Chen, Binghui Peng. On the complexity of dynamic submodular maximization. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 1685-1698, ACM, 2022. [doi]

@inproceedings{ChenP22-3,
  title = {On the complexity of dynamic submodular maximization},
  author = {Xi Chen and Binghui Peng},
  year = {2022},
  doi = {10.1145/3519935.3519951},
  url = {https://doi.org/10.1145/3519935.3519951},
  researchr = {https://researchr.org/publication/ChenP22-3},
  cites = {0},
  citedby = {0},
  pages = {1685-1698},
  booktitle = {STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022},
  editor = {Stefano Leonardi and Anupam Gupta 0001},
  publisher = {ACM},
  isbn = {978-1-4503-9264-8},
}