The Greedy Algorithm for a Generalization of the Maximum p-Facility Locationproblem and its Performance Guarantee
Shanglu He · Journal of Xianyang Normal University · 2008
This paper consider a Generalization of Maximum the facility location,We prove that the simplegreedy algorithm has performance guarantee.its idea is from one of the initial solutions,through a series of greedychoice under the current state of the optimal choice,and gradually approaching to the target set,when the algo-rithm to achieve a step can not continue to move forward,the algorithm to stop.