Author:
Batu Tuğkan,Berenbrink Petra,Sohler Christian
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. D. Applegate, L. Buriol, B. Dillard, D. Johnson, P. Shor, The cutting-stock approach to bin packing: Theory and experiments, in: Proceedings of Algorithm Engineering and Experimentation (ALENEX), 2003, pp. 1–15
2. M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, Facility location in sublinear time, in: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, 2005, pp. 866–877
3. The complexity of approximating the entropy;Batu;SIAM Journal on Computing,2005
4. B. Chazelle, R. Rubinfeld, L. Trevisan, Approximating the minimum spanning tree weight in sublinear time, in: Proceedings of the 28th International Colloquium on Automata, Languages and Programming, 2001, pp. 190–200
5. J. Csirik, D. Johnson, C. Kenyon, J. Orlin, P. Shor, R. Weber, On the sum-of-squares algorithm for bin-packing, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 208–217
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献