Sciweavers

Share
ENDM
2010
127views more  ENDM 2010»
8 years 6 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
ENDM
2010
111views more  ENDM 2010»
8 years 6 months ago
Clique and chromatic number of circular-perfect graphs
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
Arnaud Pêcher, Annegret Katrin Wagler
books