Sciweavers

374 search results - page 25 / 75
» Lower-bounded facility location
Sort
View
FOCS
2000
IEEE
14 years 2 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
CCCG
2003
13 years 11 months ago
The Gaussian Centre of a Set of Mobile Points
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...
Stephane Durocher, David G. Kirkpatrick
EOR
2006
76views more  EOR 2006»
13 years 10 months ago
Location of slaughterhouses under economies of scale
The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse in...
John v. d. Broek, Peter Schütz, Leen Stougie,...
PERCOM
2008
ACM
14 years 9 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Finding Popular Places
Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, ...
Marc Benkert, Bojan Djordjevic, Joachim Gudmundsso...