Effect of corner information in simultaneous placement of k rectangles and tableaux

We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n × n pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.Special issue of selected papers from the 16th international conference on Computing and Combinatorics (COCOON’10)info:eu-repo/semantics/publishe

Effect of corner information in simultaneous placement of K rectangles and tableaux

We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n ×n pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified. © 2010 Springer-Verlag Berlin Heidelberg.SCOPUS: cp.kinfo:eu-repo/semantics/publishe