Bicriteria Approximation Algorithms for the Submodular Cover Problem.
Wenjing ChenVictoria G. CrawfordPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- bicriteria
- efficient solutions
- np hard
- integer linear programming
- knapsack problem
- special case
- worst case
- greedy algorithm
- vertex cover
- flowshop
- minimum cost
- facility location problem
- shortest path problem
- energy minimization
- constant factor
- optimal solution
- primal dual
- approximation ratio
- objective function
- cutting plane
- combinatorial optimization problems
- branch and bound algorithm
- feasible solution
- energy function
- linear combination
- genetic algorithm
- constant factor approximation