- Full text PDF available (3)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
We study the p-median problem which is one the classical problems in location theory. For p = 2 and on a two-dimensional mesh, we give an O(mn 2 p)-time algorithm for solving the problem, where, assuming that m n, m is the number of rows of the mesh containing demand points, n the number of columns containing demand points, and p the number of demand points.
The mesh (and its variant, the torus) is a popular topology for processor interconnection in parallel computers. It has practical advantages such as low degree and perfectly compact layout when compared to other well-known topologies, for example the hypercube. A notable example of parallel computers based on the mesh topology is the iWarp system . Dally… (More)
We study the p median problem which is one the classical problems in location theory For p and on a two dimensional mesh we give an O mn p time algorithm for solving the problem where assuming that m n m is the number of rows of the mesh containing demand points n the number of columns containing demand points and p the number of demand points