TY - GEN
T1 - Submodular function minimization with submodular set covering constraints and precedence constraints
AU - Kamiyama, Naoyuki
N1 - Funding Information:
This research was supported by JST PRESTO Grant Number
Funding Information:
Acknowledgements. This research was supported by JSTPRESTO Grant Number JPMJPR14E1, Japan.
PY - 2018
Y1 - 2018
N2 - In this paper, we consider the submodular function minimization problem with submodular set covering constraints and precedence constraints, and we prove that the algorithm of McCormick, Peis, Verschae, and Wierz for the precedence constrained covering problem can be generalized to our setting.
AB - In this paper, we consider the submodular function minimization problem with submodular set covering constraints and precedence constraints, and we prove that the algorithm of McCormick, Peis, Verschae, and Wierz for the precedence constrained covering problem can be generalized to our setting.
UR - http://www.scopus.com/inward/record.url?scp=85045962291&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85045962291&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-89441-6_8
DO - 10.1007/978-3-319-89441-6_8
M3 - Conference contribution
AN - SCOPUS:85045962291
SN - 9783319894409
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 90
EP - 101
BT - Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers
A2 - Solis-Oba, Roberto
A2 - Fleischer, Rudolf
PB - Springer Verlag
T2 - 15th Workshop on Approximation and Online Algorithms, WAOA 2017
Y2 - 7 September 2017 through 8 September 2017
ER -