 This problem was first studied in 1980.It is strongly-NP hard and there exists no polynomial time approximation algorithm with a ratio smaller than formula_1 unless formula_2.However, the best approximation ratio achieved so far (by a polynomial time algorithm by Harren et al.)