Sciweavers

GD
2008
Springer

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

14 years 1 months ago
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
Evmorfia N. Argyriou, Michael A. Bekos, Michael Ka
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2008
Where GD
Authors Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
Comments (0)