Go to the corresponding LIPIcs Volume Portal |
pdf-format: |
|
@InProceedings{xiao_et_al:LIPIcs:2016:6497, author = {Mingyu Xiao and Shaowei Kou}, title = {{An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {89:1--89:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6497}, URN = {urn:nbn:de:0030-drops-64976}, doi = {10.4230/LIPIcs.MFCS.2016.89}, annote = {Keywords: sports scheduling, traveling tournament problem, approximation algorithms, timetabling combinatorial optimization} }
Keywords: | sports scheduling, traveling tournament problem, approximation algorithms, timetabling combinatorial optimization | |
Collection: | 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) | |
Issue Date: | 2016 | |
Date of publication: | 19.08.2016 |