TY - GEN
T1 - Submodular function minimization under a submodular set covering constraint
AU - Kamiyama, Naoyuki
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79955771902&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955771902&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-20877-5_14
DO - 10.1007/978-3-642-20877-5_14
M3 - Conference contribution
AN - SCOPUS:79955771902
SN - 9783642208768
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 133
EP - 141
BT - Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
T2 - 8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
Y2 - 23 May 2011 through 25 May 2011
ER -