Sciweavers

930 search results - page 1 / 186
» An Improved Approximation Algorithm for the Traveling Tourna...
Sort
View
ISAAC
2009
Springer
103views Algorithms» more  ISAAC 2009»
13 years 10 months ago
An Improved Approximation Algorithm for the Traveling Tournament Problem
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashir...
EOR
2007
364views more  EOR 2007»
13 years 3 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
EOR
2006
97views more  EOR 2006»
13 years 3 months ago
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
Andrew Lim, Brian Rodrigues, X. Zhang
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
13 years 9 months ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
TAMC
2009
Springer
13 years 10 months ago
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
Anke van Zuylen