A Note on the Inapproximability of Induced Disjoint Paths
نویسندگان
چکیده
We study the inapproximability of the induced disjoint paths problem on an arbitrary n-node m-edge undirected graph, which is to connect the maximum number of the k sourcesink pairs given in the graph via induced disjoint paths. It is known that the problem is NP-hard to approximate within m 1 2 −ε for a general k and any ε > 0. In this paper, we prove that the problem is NP-hard to approximate within n for a general k and any ε > 0 by giving a simple reduction from the independent set problem.
منابع مشابه
On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints
In this paper, we study the inapproximability of several well known optimization problems in network optimization. We show that the max directed vertex-disjoint paths problem cannot be approximated within ratio 2log1 n unless NP DTIME[2polylog n], the max directed edge-disjoint paths problem cannot be approximated within ratio 2log1 n unless NP DTIME[2polylog n], the integer multicommodity ow p...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملInapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to route as many terminal pairs as possible, subject to the constraint that at most c demands can be routed through any edge in the graph. When c = 1, the problem is simply referred to as the Edge-Disjoint Paths (EDP) pr...
متن کاملNote on the Problem of Partially Link Disjoint Paths
This paper discusses the problem of partially link disjoint paths in communication networks. The problem is situated in between the well-known shortest path generation and the synthesis of two disjoint paths. The contributions of this paper are twofold: Firstly, topologies and relevant graph properties are investigated and the degree of divergence is defined as a metric to distinguish the degre...
متن کاملHardness of Low Congestion Routing in Directed Graphs
We prove a strong inapproximability result for routing on directed graphs with low congestion. Given as input a directed graph on N vertices and a set of source-destination pairs that can be connected via edge-disjoint paths, we prove that it is hard, assuming NP doesn’t have n log n) time randomized algorithms, to route even a 1/N fraction of the pairs, even if we are allowed to use each edge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.04300 شماره
صفحات -
تاریخ انتشار 2017