Hamilton decompositions of regular tripartite tournaments

K\"uhn and Osthus conjectured in 2013 that regular tripartite tournaments are decomposable into Hamilton cycles. Somewhat surprisingly, Granet gave a simple counterexample to this conjecture almost 10 years later. In this paper, we show that the conjecture of K\"uhn and Osthus nevertheless holds in an approximate sense, by proving that every regular tripartite tournament admits an approximate decomposition into Hamilton cycles. We also study Hamilton cycle packings of directed graphs in the same regime, and show that for large $n$, every balanced tripartite digraph on $3n$ vertices which is $d$-regular for $d\ge (1+o(1))n$ admits a Hamilton decomposition.