Skip to main content
Conference Proceedings

Submodular function minimization under a submodular set covering constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6648 LNCS 133-141
DOI: 10.1007/978-3-642-20877-5_14
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we consider the problem of minimizing a submodular function under a submodular set covering constraint. We propose an approximation algorithm for this problem by extending the algorithm of Iwata and Nagano [FOCS'09] for the set cover problem with a submodular cost function. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Kamiyama, N. (2011). Submodular function minimization under a submodular set covering constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6648 LNCS, pp. 133–141). https://doi.org/10.1007/978-3-642-20877-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free