Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
On the impact of alternate path routing for load balancing in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Journal of Computer and System Sciences
Edge-Disjoint Paths in Planar Graphs
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Node-Disjoint Parallel Multi-Path Routing in Wireless Sensor Networks
ICESS '05 Proceedings of the Second International Conference on Embedded Software and Systems
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Induced disjoint paths problem in a planar digraph
Discrete Applied Mathematics
The induced disjoint paths problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Operations Research Letters
Hi-index | 0.89 |
In an undirected graph, paths P"1,P"2,...,P"k are induced disjoint if each one of them is chordless (i.e., is an induced path) and any two of them have neither common nodes nor adjacent nodes. This paper investigates the Maximum Induced Disjoint Paths (MIDP) problem: in an undirected graph G=(V,E), given k node pairs {s"1,t"1},...,{s"k,t"k}, connect maximum number of these node pairs via induced disjoint paths. Till now, the only things known about MIDP are: i) it is NP-hard; ii) it is NP-hard even when k=2; iii) it can be solved in polynomial time when k is a fixed constant and the given graph is a directed planar graph (Kobayashi, 2009 [9]). This paper proves that for general k and any @e0, it is NP-hard to approximate MIDP within m^1^/^2^-^@e, where m=|E|. Two algorithms for MIDP are given by this paper: a greedy algorithm whose approximation ratio is m and an on-line algorithm which has a good lower bound.