Sciweavers

22 search results - page 1 / 5
» On a Conjecture Related to Geometric Routing
Sort
View
ALGOSENSORS
2004
Springer
13 years 9 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak
JGT
2007
81views more  JGT 2007»
13 years 4 months ago
Pathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
David Coudert, Florian Huc, Jean-Sébastien ...
CORR
2008
Springer
94views Education» more  CORR 2008»
13 years 4 months ago
Stateless and Delivery Guaranteed Geometric Routing on Virtual Coordinate System
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
Ke Liu, Nael B. Abu-Ghazaleh
MOBICOM
2005
ACM
13 years 10 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
FOCS
2006
IEEE
13 years 10 months ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala