An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Scheduling Algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A (1-1/e)-approximation algorithm for the generalized assignment problem
Operations Research Letters
The Generalized Maximum Coverage Problem
Information Processing Letters
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Distributed Approximation of Cellular Coverage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
Dynamic entity distribution in parallel discrete event simulation
Proceedings of the 40th Conference on Winter Simulation
A multiobjective evolutionary algorithm for the task based sailor assignment problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A Novel Approximate Algorithm for Admission Control
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Proactive data dissemination to mission sites
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
A polynomial time approximation scheme for the square packing problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
IEEE/ACM Transactions on Networking (TON)
Run-time spatial resource management for real-time applications on heterogeneous MPSoCs
Proceedings of the Conference on Design, Automation and Test in Europe
Storage planning and replica assignment in content-centric publish/subscribe networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed approximation of cellular coverage
Journal of Parallel and Distributed Computing
SIAM Journal on Discrete Mathematics
Proactive data dissemination to mission sites
Wireless Networks
Daily-deal selection for revenue maximization
Proceedings of the 21st ACM international conference on Information and knowledge management
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.89 |
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the knapsack problem into an approximation algorithm for GAP. If the approximation ratio of the knapsack algorithm is α and its running time is O(f(N)), our algorithm guarantees a (1 + α)-approximation ratio, and it runs in O(M ċ f(N) + M ċ N), where N is the number of items and M is the number of bins. Not only does our technique comprise a general interesting framework for the GAP problem; it also matches the best combinatorial approximation for this problem, with a much simpler algorithm and a better running time.