169 search results - page 7 / 34 » The Tree of Hubs Location Problem |
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
AMAI
2008
Springer
14 years 11 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
82
Voted
ICMCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Overlay multicast is an efficient and deployable approach for delivering multimedia content to a large number of receivers. A key problem in overlay multicast is how to deal with...
101
Voted
SWAT
2000
Springer
15 years 3 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
82
Voted
ESA
2007
Springer
15 years 5 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...