503 search results - page 28 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
122
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
126
click to vote
ICCNMC
2005
Springer
15 years 9 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
133
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
COR
2007
15 years 3 months ago
2007
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...
141
Voted
CPM
2000
Springer
15 years 7 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...