par Anzai, Shinya;Chun, Jinhee;Kasai, Ryosei;Korman, Matias 
;Tokuyama, Takeshi
Référence Discrete Mathematics, Algorithms and Applications, 02, 04, page (527-537)
Publication Publié, 2010
;Tokuyama, TakeshiRéférence Discrete Mathematics, Algorithms and Applications, 02, 04, page (527-537)
Publication Publié, 2010
Article révisé par les pairs
| Résumé : | 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. |
