Paper Info
Title
Approximability of minimum certificate dispersal with tree structures
Abstract
Given an n-vertex graph G = ( V , E ) and a set R ¿ { { x , y } | x , y ¿ V } of requests, we consider to assign a set of edges to each vertex in G so that for every request { u , v } in R the union of the edge sets assigned to u and v contains a path from u to v. The Minimum Certificate Dispersal Problem (MCD) is defined as one to find an assignment that minimizes the sum of the cardinality of the edge set assigned to each vertex, which is originally motivated by the design of secure communications in a distributed computing. This problem has been shown to be LOGAPX-hard for general directed topologies of G and R. In this paper, we consider the complexity of MCD for more practical topologies of G and R, that is, when G or R forms an (undirected) tree; a tree structure is frequently adopted to construct an efficient communication network. We first show that MCD is still APX-hard when R is a tree, even a star. We then explore the problem from the viewpoint of the maximum degree Δ of the tree: MCD for tree request set with constant Δ is solvable in polynomial time, while that with Δ = ¿ ( n ) is 2.78-approximable in polynomial time but hard to approximate within 1.01 unless P = NP. As for the structure of G itself, we show that if G is a tree, the problem can be solved in O ( n 1 + ¿ | R | ) , where ¿ is an arbitrarily small positive constant number.
Year
DOI
Venue
2015
10.1016/j.tcs.2015.01.007
Theoretical Computer Science
Keywords
Field
DocType
Minimum certificate dispersal problem,Tree structure,Approximability
Discrete mathematics,Combinatorics,Vertex (geometry),Cardinality,Tree structure,Degree (graph theory),Spanning tree,Shortest-path tree,Time complexity,Gomory–Hu tree,Mathematics
Journal
Volume
Issue
ISSN
591
C
0304-3975
Citations 
PageRank 
References 
1
0.36
13
Authors
4
Name
Order
Citations
PageRank
Taisuke Izumi128439.02
Tomoko Izumi214121.33
Hirotaka Ono340056.98
Koichi Wada431954.11