Submodular function minimization under a submodular set covering constraint

Authors:
Naoyuki Kamiyama
Affiliations:
Department of Information and System Engineering, Chuo University
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 9
Cited 0

A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10

Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10
Submodular Approximation: Sampling-based Algorithms and Lower Bounds

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
A faster strongly polynomial time algorithm for submodular function minimization

Mathematical Programming: Series A and B
A simple combinatorial algorithm for submodular function minimization

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Submodular Function Minimization under Covering Constraints

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
On approximation of the submodular set cover problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.