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...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
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...
Jing Lei, Roy D. Yates, Larry J. Greenstein, Hang ...