763 search results - page 72 / 153 » Engineering Shortest Path Algorithms |
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
ICRA
2008
IEEE
14 years 4 months ago
2008
IEEE
— What is the shortest or fastest path a mobile robot can follow between two configurations in the unobstructed plane? The answer to this fundamental question is only known anal...
PODC
2006
ACM
14 years 4 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
FOCS
1993
IEEE
14 years 2 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...