Article ID: | iaor20071625 |
Country: | Netherlands |
Volume: | 12 |
Issue: | 4 |
Start Page Number: | 327 |
End Page Number: | 336 |
Publication Date: | Dec 2006 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Burkard Rainer E., Chen Guangting, Zhang Gu |
Keywords: | communication, internet |
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