Directional p-median in two dimensions is NP-complete

@inproceedings{Jackson2004DirectionalPI,
  title={Directional p-median in two dimensions is NP-complete},
  author={Laura E. Jackson and Matthias F. Stallmann},
  year={2004}
}
An instance of a (two-dimensional) p-median problem gives the locations of n demand points on the plane. The goal is to find p supply points that minimize the total distance of the demand points to their nearest supply point. Megiddo and Supowit [9] have shown that rectilinear and Euclidean versions of the p-median problem are NP-hard when p is part of the input. We show that the rectilinear version continues to be NP-hard under the restriction that the nearest supply point for a given demand… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…