Tag - Algorithms

JGA 2019
21ièmes Journées Graphes et Algorithmes (JGA 2019) Wed, Nov 13, 2019 11:00 CET (CONFIRMED)

Les 21ièmes Journées Graphes et Algorithmes (JGA 2019) auront lieu à Bruxelles, du 13 au 15 novembre 2019. Il s'agit du rendez-vous annuel de la communauté francophone de la théorie des graphes et de ses applications.

A time- and space-optimal algorithm for the many-visits TSP Wed, May 29, 2019 12:30 CEST

Speakers: Matthias Mnich

The many-visits traveling salesperson problem (MV-TSP) asks for an optimal tour of n cities that visits each city c a prescribed number kcof times. Travel costs may not be symmetric, and visiting a city twice in a row may incur a non-zero cost. The MV-TSP problem finds applications in scheduling, geometric approximation, and Hamiltonicity of certain graph families. The fastest known algorithm for MV-TSP is due to Cosmadakis and Papadimitriou (SICOMP, 1984).

Designing efficient algorithms for modern GPU architectures Wed, Oct 3, 2018 12:30 CEST

Speakers: Ben Karsin

Fast Fencing Wed, Feb 28, 2018 12:30 CET

Speakers: Mikkel Abrahamsen

Algorithms for k-Server Problems Wed, Feb 21, 2018 12:30 CET

Speakers: Grigorios Koumoutsos

Searching edges in the overlap of two plane graphs Wed, Jan 18, 2017 12:00 CET

Speakers: Elena Khramtcova

Transfinite Ford-Fulkerson on a Finite Network Wed, Nov 23, 2016 12:00 CET

Speakers: Tony Huynh

Today Tony will tell us about Transfinite Ford-Fulkerson on a Finite Network.