Author:
Jansen Klaus,Kratsch Stefan,Marx Dániel,Schlotter Ildikó
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Alon, N., Ruzsa, I.Z.: Non-averaging subsets and non-vanishing transversals. J. Comb. Theory, Ser. A 86(1), 1–13 (1999)
2. Bose, R.C., Chowla, S.: Theorems in the additive theory of numbers. Comment. Math. Helv. 37(1), 141–147 (1962-1963)
3. Bosznay, A.P.: On the lower estimation of non-averaging sets. Acta Math. Hung. 53, 155–157 (1989)
4. de la Vega, W.F., Lueker, G.: Bin packing can be solved in within 1 + ε in linear time. Combinatorica 1, 349–355 (1981)
5. Coffman, J.E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing, Boston (1997)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献