%0 Journal Article
%A YI Bin
%A Li Rong-heng
%T Several progress about approximation algorithm for *k*-PUFLPN
%D 2009
%R 10.3778/j.issn.1002-8331.2009.17.067
%J Computer Engineering and Applications
%P 221-224
%V 45
%N 17
%X In the preliminary discussion of the *k*-product facility location problem，a 3*k*/2-1 approximation algorithm Me is given for the problem which assumed that fixed setup cost are zero．Based on the preliminary analysis and conclusions，the tight bound of the improved algorithm Me is discussed for 2-PUFLPN．By constructing example of 2-PUFLPN，A conclusion is given that 2 is a tight bound for improved algorithm ME.At the same time，the integrality gap of 2-PUFLPN is analyzed.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.17.067