TY - JOUR
T1 - The web proxy location problem in general tree of rings networks
AU - Chen, Guangting
AU - Zhang, Gu
AU - Burkard, Rainer Ernst
PY - 2006
Y1 - 2006
N2 - The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn 2) time complexity.
AB - The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn 2) time complexity.
U2 - 10.1007/s10878-006-9002-z
DO - 10.1007/s10878-006-9002-z
M3 - Article
SN - 1573-2886
VL - 12
SP - 327
EP - 336
JO - Journal of Combinatorial Optimization
JF - Journal of Combinatorial Optimization
ER -