Login / Signup

Efficient approximation algorithms for maximum coverage with group budget constraints.

Longkun GuoMin LiDachuan Xu
Published in: Theor. Comput. Sci. (2019)
Keyphrases
  • approximation algorithms
  • np hard
  • special case
  • vertex cover
  • worst case
  • budget constraints
  • minimum cost
  • open shop
  • primal dual
  • approximation ratio
  • upper bound
  • randomized algorithms