2 search results - page 1 / 1 » Finding the best shortcut in a geometric network |
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
TRIDENTCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
To facilitate a broad range of experimental research on novel protocols and application concepts, we employ an indoor wireless testbed to emulate the performance of the real-world...