Now showing items 1-2 of 2

    • On Discrete Hyperbox Packing 

      Li, Xiafeng (2010-01-14)
      Bin packing is a very important and popular research area in the computer science field. Past work showed many good and real-world packing algorithms. How- ever, due to the complexity of the problem in multiple-dimensional ...
    • Optimization in Geometric Graphs: Complexity and Approximation 

      Kahruman-Anderoglu, Sera (2011-02-22)
      We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop ...