An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model

Eric Balkanski, Aviad Rubinstein, Yaron Singer. An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model. Operations Research, 70(5):2967-2981, 2022. [doi]

@article{BalkanskiRS22-0,
  title = {An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model},
  author = {Eric Balkanski and Aviad Rubinstein and Yaron Singer},
  year = {2022},
  doi = {10.1287/opre.2021.2170},
  url = {https://doi.org/10.1287/opre.2021.2170},
  researchr = {https://researchr.org/publication/BalkanskiRS22-0},
  cites = {0},
  citedby = {0},
  journal = {Operations Research},
  volume = {70},
  number = {5},
  pages = {2967-2981},
}