Sciweavers

284 search results - page 30 / 57
» Facility Location
Sort
View
COR
2007
99views more  COR 2007»
13 years 7 months ago
An improved algorithm for the p-center problem on interval graphs with unit lengths
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
T. C. Edwin Cheng, Liying Kang, C. T. Ng
AAIM
2005
Springer
119views Algorithms» more  AAIM 2005»
13 years 9 months ago
Locating Performance Monitoring Mobile Agents in Scalable Active Networks
The idea of active networks has been emerged in recent years to increase the processing power inside the network. The intermediate nodes such as routers will be able to host mobile...
Amir Hossein Hadad, Mehdi Dehghan, Hossein Pedram
INFOCOM
1998
IEEE
13 years 12 months ago
Demand-based Radio Network Planning of Cellular Mobile Communication Systems
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
Kurt Tutschku
ANOR
2002
99views more  ANOR 2002»
13 years 7 months ago
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
Mark S. Daskin, Collette R. Coullard, Zuo-Jun Max ...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 5 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...