The team composed of Nathann Cohen (CNRS, LRI, Paris XI) and David Coudert won the Flinders Hamiltonian Cycle Problem (FHCP) Challenge organized by the Flinders Hamiltonian Cycle Project (Flinders University, Adelaide, Australia).
The challenge consisted in solving 1001 instances of the Hamiltonian Cycle Problem over a one year period (September 30 2015 till September 30 2016). The FHCP Challenge Set is a collection of 1001 instances of the Hamiltonian Cycle Problem, ranging in size from 66 vertices up to 9528 vertices, with an average size of just over 3000 vertices.
We were able to solve 985 instances!
Fatima Zahra Moataz is the recipient of an accessit to the PhD prize Graphes “Charles Delorme” 2016 for her PhD thesis entitled Towards Efficient and Fault-Tolerant Optical Networks: Complexity and Algorithms. Congratulations !
The prize will be announced during the next Journées Graphes et Algorithmes — Paris, November 17, 2016.
16th Journées Combinatoire et Algorithmes du Littoral Méditerranéen (JCALM)
- Main topic: Hyperbolicity
- When: November 19-20, 2015
- Where: Marseille, France
- Link: conference website
Fatima Zahra Moataz received the best student paper award of the conference ALGOTEL 2015 for her paper entitled “On Spectrum Assignment in Elastic Optical Tree-Networks“.
- Title: “On Spectrum Assignment in Elastic Optical Tree-Networks“
- Author: Fatima Zahra Moataz
- Event: ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, June 2015, Beaune, France.
Abstract: To face the explosion of the Internet traffic, a new generation of optical networks is being developed; the Elastic optical Networks (EONs). The aim with EONs is to use the optical spectrum efficiently and flexibly. The benefit of the flexibility is accompanied by more difficulty in the resource allocation problems. In this report, we study the problem of Spectrum Allocation in Elastic Optical Tree-Networks. In trees, even though the routing is fixed, the spectrum allocation is NP-hard. We survey the complexity and approximability results that have been established for the SA in trees and prove new results for stars and binary trees.
Keywords: Interval coloring; Optical networks; Routing and Spectrum Assignment; Approximation algorithms.
Bi Li (李碧) is recipient of the Chinese government award for outstanding self-financed students abroad, edition 2014, for her PhD thesis entitled “Tree Decompositions and Routing Problems“. Congratulation !
More details can be found here and here (in chinese).
15th Journées Combinatoire et Algorithmes du Littoral Méditerranéen (JCALM)
- Main topic: Advanced Complexity
- When: March 10-11, 2015
- Where: Sophia-Antipolis, France
- Link: conference website