暂无分享,去创建一个
[1] Joseph Y.-T. Leung,et al. Packing Squares into a Square , 1990, J. Parallel Distributed Comput..
[2] Nils Schweer,et al. Algorithms for Packing Problems , 2010 .
[3] C. K. Wong,et al. Near-Optimal Solutions to a 2-Dimensional Placement Problem , 1975, SIAM J. Comput..
[4] Manfred Nagl,et al. Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.
[5] E. Demaine,et al. What is the optimal shape of a city , 2004 .
[6] Sándor P. Fekete,et al. A competitive strategy for distance-aware online shape allocation , 2014, Theor. Comput. Sci..
[7] Bettina Speckmann,et al. Treemaps with bounded aspect ratio , 2010, Comput. Geom..
[8] Michael Lindenbaum,et al. On the metric properties of discrete space-filling curves , 1996, IEEE Trans. Image Process..
[9] Martin Wattenberg. A note on space-filling visualizations and space-filling curves , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..
[10] Cynthia A. Phillips,et al. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance , 2007, Algorithmica.
[11] Günter Rote,et al. Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? , 2009, CCCG.
[12] Madhav V. Marathe,et al. Compact Location Problems , 1993, Theor. Comput. Sci..
[13] Rani Siromoney,et al. Space-filling curves and infinite graphs , 1982, Graph-Grammars and Their Application to Computer Science.
[14] Hung-Chi Su,et al. On the Locality Properties of Space-Filling Curves , 2003, ISAAC.
[15] Rolf Niedermeier,et al. Towards optimal locality in mesh-indexings , 1997, Discret. Appl. Math..
[16] Cynthia A. Phillips,et al. Communication-Aware Processor Allocation for Supercomputers , 2005, WADS.
[17] Esther M. Arkin,et al. Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies , 2002, Proceedings. IEEE International Conference on Cluster Computing.