Skip Navigation

The Computer Journal 2001 44(2):101-108; doi:10.1093/comjnl/44.2.101
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lau, F. C. M.
Right arrow Articles by Tse, S. S. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Algorithm for the 2-Median Problem on Two-Dimensional Meshes

F. C. M. Lau1, P. K. W. Cheng1 and S. S. H. Tse1

1 Department of Computer Science and Information Systems, The University of Hong Kong, Hong Kong, People's Republic of China Email: fcmlau@csis.hku.hk 2 A preliminary version of this paper, entitled ‘An Algorithm for the Location Problem in Two-Dimensional Meshes’, appeared in Proc. MFCS '98 Workshop on Communication, August 1998, pp. 76–90.

We study the $p$-median problem which is one of the classical problems in location theory. For $p= 2$ and on a two-dimensional mesh, we give an $O(mn^{2}q)$-time algorithm for solving the problem, where, assuming that $m\geq n$, $m$ is the number of rows of the mesh containing demand points, $n$ the number of columns containing demand points and $q$ the number of demand points.

Received 1 October, 1999. Revised 12 February, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.