2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.CC2021★ 1 cited
Complexity of Traveling Tournament Problem with Trip Length More Than Three
Diptendu Chatterjee
The Traveling Tournament Problem is a sports-scheduling problem where the goal is to minimize the total travel distance of teams playing a double round-robin tournament. The constr…
cs.DS2021★ 2 cited
An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two
Diptendu Chatterjee, Bimal Kumar Roy
The Traveling Tournament Problem(TTP) is a combinatorial optimization problem where we have to give a scheduling algorithm which minimizes the total distance traveled by all the pa…