A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint

Tianshuai Zhu, Kai Han 0003, Enpei Zhang, Benwei Wu. A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint. In 2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys), Haikou, Hainan, China, December 20-22, 2021. pages 462-469, IEEE, 2021. [doi]

@inproceedings{ZhuHZW21-1,
  title = {A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint},
  author = {Tianshuai Zhu and Kai Han 0003 and Enpei Zhang and Benwei Wu},
  year = {2021},
  doi = {10.1109/HPCC-DSS-SmartCity-DependSys53884.2021.00085},
  url = {https://doi.org/10.1109/HPCC-DSS-SmartCity-DependSys53884.2021.00085},
  researchr = {https://researchr.org/publication/ZhuHZW21-1},
  cites = {0},
  citedby = {0},
  pages = {462-469},
  booktitle = {2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys), Haikou, Hainan, China, December 20-22, 2021},
  publisher = {IEEE},
  isbn = {978-1-6654-9457-1},
}