DocumentCode
3090865
Title
An approximation solution for the 2-median problem on two-dimensional meshes
Author
Tse, Savio S H ; Lau, Francis C M
Author_Institution
Dept. of Comput. Sci., Hong Kong Univ., China
Volume
2
fYear
2005
fDate
28-30 March 2005
Firstpage
457
Abstract
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(m2 + q log q)-time approximation algorithm for solving the problem with worst-case ratio 1.5 + δ on the communication cost, where m is the number of rows of the mesh containing demand points, n the number of columns containing demand points, m ≥ n,q the number of demand points, and δ is some positive constant which can be as small as needed.
Keywords
computational complexity; mesh generation; multiprocessor interconnection networks; parallel programming; 2-median problem; 2D mesh; approximation algorithm; approximation solution; distributed computing; location theory; parallel computing; Approximation algorithms; Computer networks; Computer science; Concurrent computing; Costs; Distributed computing; Hypercubes; Network topology; Parallel processing; Tree graphs; P-median; approximation algorithms; distributed; location problem; mesh; parallel computers;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on
ISSN
1550-445X
Print_ISBN
0-7695-2249-1
Type
conf
DOI
10.1109/AINA.2005.92
Filename
1423733
Link To Document