For an undirected edge-weighted graph $G$ and a set $R$ of pairs vertices called terminals, multicut is edges such that removing these from disconnects each pair in $R$. We provide algorithm computing $(1+\varepsilon)$-approximation the minimum time $(g+t)^{(O(g+t)^3)}\cdot(1/\varepsilon)^{O(g+t)} \cdot n \log n$, where $g$ genus $t$ number terminals. This tight several aspects, as problem both...