Before revision:  We show that this combinatorial anchor selection problem is NP-hard and  consequently, develop a greedy (1-1/e) approximation .
After revision:  We show that this combinatorial anchor selection problem is NP-hard and , consequently, develop a greedy (1-1/e) approximation .