Evènement pour le groupe

**GT Graphes et Applications**
Date | 2010-03-12 14:00-15:00 |

Titre | Interval graphs and packing problem |

Résumé | The Bi-dimensional Orthogonal Packing Problem (OPP-2) is a classical NP-complete problem consisting in deciding whether a set of rectangular boxes (items) can be packed in a ”big” rectangular container without overlapping. In the classical formulation of the problem, the rotation of items is not allowed. I will present a new algorithm for solving OPP-2 based on the characterization of solutions using interval graphs proposed by Fekete and Schepers. The algorithm uses MPQ-trees - combinatorial structures introduced by Korte and Möhring for interval graph recognition in linear time. I will conclude with the running times of our algorithm on classical benchmarks compared to those of other algorithms from the literature. |

Lieu | Salle 178 |

Orateur | Petru Valicov |

Aucun document lié à cet événement.

RetourRetour à l'index