Sciweavers

98 search results - page 3 / 20
» Complexity of the traveling tournament problem
Sort
View
CPAIOR
2006
Springer
13 years 11 months ago
Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling
Abstract. This paper considers all the variants of the traveling tournament prob) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United ...
Pascal Van Hentenryck, Yannis Vergados
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
13 years 11 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
CPAIOR
2006
Springer
13 years 11 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
MFCS
2007
Springer
14 years 1 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner