Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem

  • Authors:

  • Tomoko Izumi;Taisuke Izumi;Hirotaka Ono;Koichi Wada

  • Affiliations:

  • College of Information Science and Engineering, Ritsumeikan University, Kusatsu, Japan 525-8577;Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466-8555;Graduate School of Information Science and Electrical Engineering, Kyushu University, Fukuoka, Japan 819-0395;Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466-8555

  • Venue:
  • COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a graph G = (V ,E ) and a set R *** V ×V of requests, we consider to assign a set of edges to each node 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 node. In this paper, we give an advanced investigation about the difficulty of MCD by focusing on the relationship between its (in)approximability and request structures. We first show that MCD with general R has ***(logn ) lower and upper bounds on approximation ratio under the assumption P *** NP , where n is the number of nodes in G . We then assume R forms a clique structure, called Subset-Full , which is a natural setting in the context of the application. Interestingly, under this natural setting, MCD becomes to be 2-approximable, though it has still no polynomial time approximation algorithm whose factor better than 677/676 unless P = NP . Finally, we show that this approximation ratio can be improved to 3/2 for undirected variant of MCD with Subset-Full.