Hartstein, Itamar and Shalom, Mordechai and Zaks, Shmuel (2013) On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters. In: Approximation and Online Algorithms, 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Lecture Notes in Computer Science, 7846 (12). Springer Berlin Heidelberg, pp. 42-55. ISBN 978-3-642-38015-0Full text not available from this repository.
We deal with the Regenerator Location Problem in optical networks. We are given a network G = (V, E), and a set Q of communication requests between pairs of terminals in V. We investigate two variations: one in which we are given a routing P of the requests in Q , and one in which we are required to find also the routing. In both cases, each path in P must contain a regenerator after every d edges in order to deal with loss of signal quality for some d > 0. The goal is to minimize the number of vertices that contain regenerators used by the solution. Both variations of the problem are \textscNP−hard in the general case. In this work we investigate the parameterized complexity of the problem. We introduce several fixed parameter tractability results and polynomial algorithms for fixed parameter values, as well as several \textscNP−hardness results. The parameters under consideration are the treewidth of the input graph, the sizes d and |Q| and the vertex load, i.e. the maximum number of paths passing through any vertex.
|Item Type:||Book Chapters|
|Uncontrolled Keywords:||Approximation algorithms; competitive analysis; graph drawing; online algorithms; wafer-to-wafer integration.|
|Depositing User:||Rebeca De Miguel|
|Date Deposited:||11 Mar 2014 11:47|
|Last Modified:||27 Dec 2016 12:17|
Actions (login required)