C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.
Yishuo Shi
Zhao Zhang
Ding-Zhu Du
Published in:
AAIM (2018)
Keyphrases
</>
bicriteria
dynamic programming
knapsack problem
objective function
optimal solution
search space
cost function
computational complexity
np hard
integer linear programming
neural network
linear programming
convex hull
greedy algorithm
minimum cost