Author:
Freivalds Karlis,Dogrusoz Ugur,Kikusts Paulis
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. B. S. Baker, E. G. Coffman, and R. S. Rivest. Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4):846–855, November 1980.
2. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: An updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors, Algorithm Design for Computer System Design, pages 49–106. Springer-Verlag, New York, 1984.
3. E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4):808–826, November 1990.
4. E. G. Coffman and P. W. Shor. Packings in two dimensions: Asymptotic averagecase analysis of algorithms. Algorithmica, 9:253–277, 1993.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235–282, 1994.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献