Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2505.06828 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909607294664704 |
|---|---|
| author | Zhao, Jingyang Xiao, Mingyu |
| author_facet | Zhao, Jingyang Xiao, Mingyu |
| contents | The bipartite traveling tournament problem (BTTP) addresses inter-league sports scheduling, which aims to design a feasible bipartite tournament between two $n$-team leagues under some constraints such that the total traveling distance of all participating teams is minimized. Since its introduction, several methods have been developed to design feasible schedules for NBA, NPB and so on. In terms of solution quality with a theoretical guarantee, previously only a $(2+\varepsilon)$-approximation is known for the case that $n\equiv 0 \pmod 3$. Whether there are similar results for the cases that $n\equiv 1 \pmod 3$ and $n\equiv 2 \pmod 3$ was asked in the literature. In this paper, we answer this question positively by proposing a $(3/2+\varepsilon)$-approximation algorithm for any $n$ and any constant $\varepsilon>0$, which also improves the previous approximation ratio for the case that $n\equiv 0 \pmod 3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_06828 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling Zhao, Jingyang Xiao, Mingyu Data Structures and Algorithms The bipartite traveling tournament problem (BTTP) addresses inter-league sports scheduling, which aims to design a feasible bipartite tournament between two $n$-team leagues under some constraints such that the total traveling distance of all participating teams is minimized. Since its introduction, several methods have been developed to design feasible schedules for NBA, NPB and so on. In terms of solution quality with a theoretical guarantee, previously only a $(2+\varepsilon)$-approximation is known for the case that $n\equiv 0 \pmod 3$. Whether there are similar results for the cases that $n\equiv 1 \pmod 3$ and $n\equiv 2 \pmod 3$ was asked in the literature. In this paper, we answer this question positively by proposing a $(3/2+\varepsilon)$-approximation algorithm for any $n$ and any constant $\varepsilon>0$, which also improves the previous approximation ratio for the case that $n\equiv 0 \pmod 3$. |
| title | An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2505.06828 |