An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
The budgeted maximum coverage problem
Information Processing Letters
Budgeted Maximum Graph Coverage
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An efficient approximation for the generalized assignment problem
Information Processing Letters
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
IEEE/ACM Transactions on Networking (TON)
Brief announcement: pan and scan
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: configuration of actuated camera networks for multi-target coverage
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Batch query processing for web search engines
Proceedings of the fourth ACM international conference on Web search and data mining
Summarization of archived and shared personal photo collections
Proceedings of the 20th international conference companion on World wide web
Summarization of personal photologs using multidimensional content and context
Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Selection of the most suitable measurement path for router abnormality detection
CSCS '11 Proceedings of the 2nd international conference on Circuits, systems, control, signals
TreeMatrix: A Hybrid Visualization of Compound Graphs
Computer Graphics Forum
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
Where shall we go today?: planning touristic tours with tripbuilder
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Multi-winner social choice with incomplete preferences
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.89 |
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)+@e)-approximation for every @e0, and then use partial enumeration to reduce the approximation ratio to e(e-1)+@e.