Author:
Alon Noga,Csirik János,Sevastianov Sergey V.,Vestjens Arjen P. A.,Woeginger Gerhard J.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. N. Alon, Transversal numbers of uniform hypergraphs, Graphs and Combinatorics
6, 1990, 1–4.
2. S.F. Assmann, “Problems in Discrete Applied Mathematics”, 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, 1984, 502–525.
4. J. Beck and T. Fiala, Integer-making Theorems, Disc. Appl. Math.
3, 1981, 1–8.
5. J. Csirik and J.B.G. Frenk, A dual version of bin packing, Algorithms Review
1, 1990, 87–95.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Approximation schemes for covering and scheduling in related machines;Approximation Algorithms for Combinatiorial Optimization;1998
2. On-line machine covering;Algorithms — ESA '97;1997