503 search results - page 79 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
108
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
110
click to vote
COR
2006
15 years 3 months ago
2006
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
125
click to vote
JCO
2006
15 years 3 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
144
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
118
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...