632 search results - page 66 / 127 » On Routing in Circulant Graphs |
COR
2008
14 years 10 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
NETWORKS
2011
14 years 4 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
IPSN
2010
Springer
15 years 4 months ago
2010
Springer
We study the utility of dynamic frequency agility in realworld wireless sensor networks. Many view such agility as essential to obtaining adequate reliability in industrial enviro...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
QSHINE
2005
IEEE
15 years 3 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...