Communication dans un congrès, GALaC, Algorithme et structure de données

On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem

Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem. International Conference Combinatorial Optimization and Applications (COCOA), Dec 2018, Atlanta, United States. ⟨hal-02022459⟩

Publié le