Submodular function minimization under a submodular set covering constraint

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings
Pages133-141
Number of pages9
Volume6648 LNCS
DOIs
Publication statusPublished - May 13 2011
Externally publishedYes
Event8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011 - Tokyo, Japan
Duration: May 23 2011May 25 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6648 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th Annual Conference on Theory and Applications of Models of Computation, TAMC 2011
CountryJapan
CityTokyo
Period5/23/115/25/11

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Submodular function minimization under a submodular set covering constraint'. Together they form a unique fingerprint.

  • Cite this

    Kamiyama, N. (2011). Submodular function minimization under a submodular set covering constraint. In Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings (Vol. 6648 LNCS, pp. 133-141). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6648 LNCS). https://doi.org/10.1007/978-3-642-20877-5_14