Author:
Cohen Reuven,Katzir Liran
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. A.A. Ageev, M. Sviridenko, Approximation algorithms for maximum coverage and max cut with given sizes of parts, in: IPCO, 1999, pp. 17–30
2. An efficient approximation for the generalized assignment problem;Cohen;Inform. Process. Lett.,2006
3. L. Fleischer, M.X. Goemans, V.S. Mirrokni, M. Sviridenko, Tight approximation algorithms for maximum general assignment problems, in: SODA'06: Proceedings of the Sixtieth Annual ACM–SIAM Symposium on Discrete Algorithms, 2006
4. Approximation Algorithms for NP-hard Problems;Hochbaum,1997
5. Knapsack Problems;Kellerer,2004
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献