The Generalized Maximum Coverage Problem

We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a (2e-1 e-1 + )-approximation for every > 0, and then use partial enumeration to reduce the approximation ratio to e e-1 + .

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Reuven Cohen, Liran Katzir
• Keywords: Generalized Maximum Coverage, IPL 2008, Maximum Coverage Problem, Wireless Ofdma Scheduling