Back to Search
Start Over
Minimization Problems with Non-Submodular Cover Constraint.
- Source :
- Asia-Pacific Journal of Operational Research; Oct2023, Vol. 40 Issue 5, p1-19, 19p
- Publication Year :
- 2023
-
Abstract
- The set cover problem has been studied extensively for many years. Submodular function plays a key role in combinatorial optimization. Extending the set cover problem, we consider three submodular cover problems. The first two problems minimize linear and submodular functions, respectively, subject to the same non-submodular cover constraint. The third problem minimizes a submodular function subject to non-submodular cover and precedence constraints. Based on the concepts of submodular ratio and gap, and Lovász extension, we devise greedy and primal–dual approximation algorithms for these problems. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02175959
- Volume :
- 40
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- Asia-Pacific Journal of Operational Research
- Publication Type :
- Academic Journal
- Accession number :
- 172755444
- Full Text :
- https://doi.org/10.1142/S0217595923400122