Approximation algorithms for maximum weighted target cover problem with distance limitations.
Jianhong JinYingli RanZhao ZhangPublished in: J. Comb. Optim. (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- weighted distance
- vertex cover
- np hardness
- minimum cost
- network design problem
- minimum distance
- set cover
- open shop
- integrality gap
- facility location problem
- combinatorial auctions
- total weight
- longest common subsequence
- undirected graph
- disjoint paths
- distance function
- constant factor
- distance measure
- randomized algorithms
- genetic algorithm
- constant factor approximation
- approximation schemes
- approximation ratio
- precedence constraints
- linear programming
- lower bound