169 search results - page 9 / 34 » The Tree of Hubs Location Problem |
JCP
2006
14 years 11 months ago
2006
Abstract-- Mobile location estimation is becoming an important value-added service for a mobile phone operator. It is well-known that GPS can provide an accurate location estimatio...
103
click to vote
IPCO
2001
15 years 1 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
DAM
2000
14 years 11 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...