Sciweavers

ICCSA
2004
Springer
13 years 10 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
ICCSA
2004
Springer
13 years 10 months ago
A Cluster Based Hierarchical Routing Protocol for Mobile Networks
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
Kayhan Erciyes, Geoffrey Marshall