UAI 2021poster5 citations
Approximation algorithm for submodular maximization under submodular cover
Naoto Ohsaka, Tatsuya Matsuoka
Abstract
We study a new optimization problem called
BibTeX
@InProceedings{pmlr-v161-ohsaka21a,
title = {Approximation algorithm for submodular maximization under submodular cover},
author = {Ohsaka, Naoto and Matsuoka, Tatsuya},
booktitle = {Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence},
pages = {792--801},
year = {2021},
editor = {de Campos, Cassio and Maathuis, Marloes H.},
volume = {161},
series = {Proceedings of Machine Learning Research},
month = {27--30 Jul},
publisher = {PMLR},
pdf = {https://proceedings.mlr.press/v161/ohsaka21a/ohsaka21a.pdf},
url = {https://proceedings.mlr.press/v161/ohsaka21a.html},
abstract = {We study a new optimization problem called