Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IPL
2008

favoriteEmaildiscussreport

95views more IPL 2008»

The Generalized Maximum Coverage Problem

13 years 4 months ago

The Generalized Maximum Coverage Problem

Download www.cs.technion.ac.il

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 + .

Reuven Cohen, Liran Katzir

Real-time Traffic

Generalized Maximum Coverage | IPL 2008 | Maximum Coverage Problem | Wireless Ofdma Scheduling |

claim paper

Related Content

» Trap Coverage Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks

» Maximum Coverage Problem with Group Budget Constraints and Applications

» Text Summarization Model Based on Maximum Coverage Problem and its Variant

» Donation Center Location Problem

» On Approximating Four Covering and Packing Problems

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

» On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment

» Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks

» Maximum Betweenness Centrality Approximability and Tractable Cases

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Reuven Cohen, Liran Katzir

Comments (0)