Approximation Algorithms for Maximum Coverage with Group Budget Constraints.
Longkun GuoMin LiDachuan XuPublished in: COCOA (2) (2017)
Keyphrases
- approximation algorithms
- budget constraints
- np hard
- special case
- vertex cover
- quasi linear
- worst case
- minimum cost
- approximation ratio
- primal dual
- multi unit
- precedence constraints
- combinatorial auctions
- open shop
- constant factor
- randomized algorithms
- integrality gap
- scheduling problem
- constant factor approximation
- multi agent systems
- electronic commerce
- lower bound