Minimum certificate dispersal with tree structures

Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 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; tree structures are frequently adopted to construct efficient communication networks. 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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings
Pages548-559
Number of pages12
DOIs
Publication statusPublished - May 18 2012
Event9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012 - Beijing, China
Duration: May 16 2012May 21 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7287 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012
CountryChina
CityBeijing
Period5/16/125/21/12

Fingerprint

Certificate
Tree Structure
Topology
Polynomials
Distributed computer systems
Telecommunication networks
Stars
Polynomial time
Vertex of a graph
Secure Communication
Distributed Computing
Maximum Degree
Communication Networks
Assign
Cardinality
Star
Union
Assignment
Minimise
Path

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Izumi, T., Izumi, T., Ono, H., & Wada, K. (2012). Minimum certificate dispersal with tree structures. In Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings (pp. 548-559). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7287 LNCS). https://doi.org/10.1007/978-3-642-29952-0_51

Minimum certificate dispersal with tree structures. / Izumi, Taisuke; Izumi, Tomoko; Ono, Hirotaka; Wada, Koichi.

Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. 2012. p. 548-559 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7287 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Izumi, T, Izumi, T, Ono, H & Wada, K 2012, Minimum certificate dispersal with tree structures. in Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7287 LNCS, pp. 548-559, 9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012, Beijing, China, 5/16/12. https://doi.org/10.1007/978-3-642-29952-0_51
Izumi T, Izumi T, Ono H, Wada K. Minimum certificate dispersal with tree structures. In Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. 2012. p. 548-559. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-29952-0_51
Izumi, Taisuke ; Izumi, Tomoko ; Ono, Hirotaka ; Wada, Koichi. / Minimum certificate dispersal with tree structures. Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. 2012. pp. 548-559 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6d0fd2c4af4c47af9457aa086f0d2be5,
title = "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 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; tree structures are frequently adopted to construct efficient communication networks. 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.",
author = "Taisuke Izumi and Tomoko Izumi and Hirotaka Ono and Koichi Wada",
year = "2012",
month = "5",
day = "18",
doi = "10.1007/978-3-642-29952-0_51",
language = "English",
isbn = "9783642299513",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "548--559",
booktitle = "Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings",

}

TY - GEN

T1 - Minimum certificate dispersal with tree structures

AU - Izumi, Taisuke

AU - Izumi, Tomoko

AU - Ono, Hirotaka

AU - Wada, Koichi

PY - 2012/5/18

Y1 - 2012/5/18

N2 - 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 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; tree structures are frequently adopted to construct efficient communication networks. 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.

AB - 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 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; tree structures are frequently adopted to construct efficient communication networks. 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.

UR - http://www.scopus.com/inward/record.url?scp=84861010425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861010425&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-29952-0_51

DO - 10.1007/978-3-642-29952-0_51

M3 - Conference contribution

SN - 9783642299513

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 548

EP - 559

BT - Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings

ER -