Skip to main content
Article thumbnail
Location of Repository

The Two-Median Problem on Manhattan Meshes

By Mordecai J. Golin and Yan Zhang


We investigate the two-median problem on a mesh with M columns and N rows (M ≥ N), under the Manhattan (L1) metric. We derive exact algorithms with respect to m, n, and r, the number of columns, rows, and vertices, respectively, that contain requests. Specifically, we give an O(mn 2 log m) time, O(r) space algorithm for general (nonuniform) meshes (assuming m ≥ n). For uniform meshes, we give two algorithms both using O(MN) space. One is an O(MN 2) time algorithm, while the other is an algorithm running in O(MN log N) time with high probability and in O(MN 2) time in the worst case assuming the weights are independent and identically distributed random variables satisfying certain natural conditions. These improve upon the previously bestknown algorithm that runs in O(mn 2 r) time. © 2007 Wile

Topics: two-median, mesh, probabilistic analysis
Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.