Author:
Hoogeveen Han,Skutella Martin,Woeginger Gerhard J.
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. S. Arora AND C. Lund [1997]. Hardness of approximation. In: D.S. Hochbaum (ed.) Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, 399–446.
2. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, AND L. Stou-Gie [2000]. Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics 13, 64–78.
3. D. Bertsimas, C. Teo, AND R. Vohra [1996]. On Dependent Randomized Rounding Algorithms. Proceedings of the 5th International IPCO Conference, Springer LNCS 1084, 330–344.
4. P. Crescenzi AND V. Kann [1997]. A compendium of NP-optimization problems. http://www.nada.kth.se/nada/theory/problemlist.html .
5. D.W. Engels, D.R. Karger, S.G. Kolliopoulos, S. Sengupta, R.N. Uma, AND J. Wein [1998]. Techniques for scheduling with rejection. Proceedings of the 6th European Symposium on Algorithms (ESA’98), Springer LNCS 1461, 490–501.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献