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