2343 search results - page 152 / 469 » The Locomotive Routing Problem |
179
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
152
click to vote
GLOBECOM
2009
IEEE
16 years 27 days ago
2009
IEEE
—Most research works in routing and design of optical networks assume that the optical medium can carry data signals without any bit error. However, physical impairments of the o...
167
click to vote
ICNP
2009
IEEE
16 years 24 days ago
2009
IEEE
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
160
click to vote
NOMS
2008
IEEE
16 years 16 days ago
2008
IEEE
— To support large-scale Internet-based broadcast of live streaming video efficiently in content delivery networks (CDNs), it is essential to implement a cost-effective overlay ...
127
Voted
WADS
2007
Springer
16 years 8 days ago
2007
Springer
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...