2343 search results - page 106 / 469 » The Locomotive Routing Problem |
110
click to vote
MST
2010
15 years 1 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
150
Voted
ICAI
2010
15 years 1 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
136
click to vote
ADHOCNOW
2005
Springer
15 years 8 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
128
click to vote
COMCOM
2010
15 years 1 months ago
2010
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
128
click to vote
APNOMS
2009
Springer
15 years 9 months ago
2009
Springer
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...