177 search results - page 23 / 36 » Link Distance and Shortest Path Problems in the Plane |
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
EOR
2007
13 years 8 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
DAGSTUHL
2003
13 years 10 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
COR
2008
13 years 8 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
COLOGNETWENTE
2008
13 years 10 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...