Sciweavers

374 search results - page 56 / 75
» Lower-bounded facility location
Sort
View
133
Voted
FSR
2003
Springer
94views Robotics» more  FSR 2003»
15 years 9 months ago
Planning under Uncertainty for Reliable Health Care Robotics
We describe a mobile robot system, designed to assist residents of an retirement facility. This system is being developed to respond to an aging population and a predicted shortage...
Nicholas Roy, Geoffrey J. Gordon, Sebastian Thrun
141
Voted
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 5 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
147
Voted
COR
2000
129views more  COR 2000»
15 years 3 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
111
Voted
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
15 years 10 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
131
Voted
CIG
2006
IEEE
15 years 9 months ago
Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara