Minimizing the number of ADMs with and without Traffic Grooming: Complexity and Approximability