Linear Query Approximation Algorithms for Non-Monotone Submodular Maximization Under Knapsack Constraint

Cite

Text

Pham et al. "Linear Query Approximation Algorithms for Non-Monotone Submodular Maximization Under Knapsack Constraint." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/459

Markdown

[Pham et al. "Linear Query Approximation Algorithms for Non-Monotone Submodular Maximization Under Knapsack Constraint." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/pham2023ijcai-linear/) doi:10.24963/IJCAI.2023/459

BibTeX

@inproceedings{pham2023ijcai-linear,
  title     = {{Linear Query Approximation Algorithms for Non-Monotone Submodular Maximization Under Knapsack Constraint}},
  author    = {Pham, Canh V. and Tran, Tan D. and Ha, Dung K. T. and Thai, My T.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {4127-4135},
  doi       = {10.24963/IJCAI.2023/459},
  url       = {https://mlanthology.org/ijcai/2023/pham2023ijcai-linear/}
}