More precisely, we show that there is a choice of ctrans(P., P.+1) which makes the shortest mobile path problem NP-complete, even if the static path metric remains the simple ... static path metric w, (P) is additive in a mobile graph G = G1 .

Title | : | Proceedings of the ... Annual ACM/IEEE International Conference on Mobile Computing and Networking |

Author | : | |

Publisher | : | - 2001 |

Continue