An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two

Mingyu Xiao, Shaowei Kou. An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, editors, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. Volume 58 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{XiaoK16,
  title = {An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two},
  author = {Mingyu Xiao and Shaowei Kou},
  year = {2016},
  doi = {10.4230/LIPIcs.MFCS.2016.89},
  url = {http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.89},
  researchr = {https://researchr.org/publication/XiaoK16},
  cites = {0},
  citedby = {0},
  booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland},
  editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  volume = {58},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-016-3},
}