Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem.
Canh V. PhamQuat V. PhuDung T. K. HaPublished in: CSoNet (2023)
Keyphrases
- bicriteria
- minimum cost
- np hard
- objective function
- approximation ratio
- approximation algorithms
- dynamic programming
- network flow
- optimal solution
- worst case
- cost function
- search space
- knapsack problem
- computational complexity
- particle swarm optimization
- path planning
- space complexity
- shortest path problem
- network flow problem
- spanning tree
- hybrid algorithm
- greedy algorithm
- lower bound