Approximation algorithms for a geometric set cover problem.
Valentin E. BrimkovAndrew LeachJimmy WuMichael MastroianniPublished in: Discret. Appl. Math. (2012)
Keyphrases
- set cover
- approximation algorithms
- greedy heuristics
- np hard
- worst case
- special case
- vertex cover
- minimum cost
- primal dual
- approximation ratio
- constant factor
- randomized algorithms
- open shop
- approximation schemes
- precedence constraints
- greedy algorithm
- undirected graph
- genetic algorithm
- convex hull
- scheduling problem
- disjoint paths
- optimal solution