Show simple item record

dc.contributor.authorFomin, Fedor
dc.contributor.authorGolovach, Petr
dc.contributor.authorKarpov, Nikolay
dc.contributor.authorKulikov, Alexander S
dc.date.accessioned2016-05-30T07:31:50Z
dc.date.available2016-05-30T07:31:50Z
dc.date.issued2015
dc.PublishedLeibniz International Proceedings in Informatics 2015, 45:408-419eng
dc.identifier.issn1868-8969en_US
dc.identifier.urihttps://hdl.handle.net/1956/12027
dc.description.abstractThe Secluded Path problem introduced by Chechik et al. in [ESA 2013] models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of vertices in its closed neighborhood. In order to minimize the risk of intercepting the information, we are interested in selecting a secluded path, i.e. a path with a small exposure. Similarly, the Secluded Steiner Tree problem is to find a tree in a graph connecting a given set of terminals such that the exposure of the tree is minimized. In this work, we obtain the following results about parameterized complexity of secluded connectivity problems. We start from an observation that being parameterized by the size of the exposure, the problem is fixed-parameter tractable (FPT). More precisely, we give an algorithm deciding if a graph G with a given cost function w:V(G)->N contains a secluded path of exposure at most k with the cost at most C in time O(3^{k/3}(n+m) log W), where W is the maximum value of w on an input graph G. Similarly, Secluded Steiner Tree is solvable in time O(2^{k}k^2 (n+m) log W). The main result of this paper is about "above guarantee" parameterizations for secluded problems. We show that Secluded Steiner Tree is FPT being parameterized by r+p, where p is the number of the terminals, l the size of an optimum Steiner tree, and r=k-l. We complement this result by showing that the problem is co-W[1]-hard when parameterized by r only. We also investigate Secluded Steiner Tree from kernelization perspective and provide several lower and upper bounds when parameters are the treewidth, the size of a vertex cover, maximum vertex degree and the solution size. Finally, we refine the algorithmic result of Chechik et al. by improving the exponential dependence from the treewidth of the input graph.en_US
dc.language.isoengeng
dc.publisherDagstuhl Publishingen_US
dc.rightsAttribution CC BY 3.0eng
dc.rights.urihttp://creativecommons.org/licenses/by/3.0eng
dc.subjectSecluded patheng
dc.subjectSecluded Steiner treeeng
dc.subjectParameterized complexityeng
dc.titleParameterized complexity of secluded connectivity problemsen_US
dc.typeConference object
dc.typePeer reviewed
dc.typeJournal article
dc.date.updated2016-03-30T10:15:20Z
dc.description.versionpublishedVersionen_US
dc.rights.holderCopyright Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, and Alexander S. Kulikoven_US
dc.identifier.doihttps://doi.org/10.4230/lipics.fsttcs.2015.408
dc.identifier.cristin1320281
dc.subject.nsiVDP::Matematikk og Naturvitenskap: 400en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution CC BY 3.0
Except where otherwise noted, this item's license is described as Attribution CC BY 3.0