Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. N. Alon, J. Csirik, S. V. Sevastianov, A. P. A. Vestjens, and G. J. Woeginger. On-line and off-line approximation algorithms for vector covering problems. In Proc. 4th European Symposium on Algorithms, LNCS, pages 406–418. Springer, 1996.
2. S.F. Assmann. Problems in discrete applied mathematics. Technical report, Doctoral Dissertation, Mathematics Department, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1983.
3. S.F. Assmann, D.S. Johnson, D.J. Kleitman, and J.Y.-T. Leung. On a dual version of the one-dimensional bin packing problem. J. Algorithms, 5:502–525, 1984.
4. Y. Azar and L. Epstein. On-line machine covering. In 5th Annual European Symposium on Algorithms, pages 23–36, 1997.
5. J. Csirik, H. Kellerer, and G. Woeginger. The exact lpt-bound for maximizing the minimum completion time. Operations Research Letters, 11:281–287, 1992.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献