Improved approximation algorithms for firefighter problem on trees

Yutakaa Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui

研究成果: ジャーナルへの寄稿記事

17 引用 (Scopus)

抄録

The firefighter problem is used to model the spread of fire, infectious diseases, and computer viruses. This paper deals with firefighter problem on rooted trees. It is known that the firefighter problem is NPhard even for rooted trees of maximum degree 3. We propose techniques to improve a given approximation algorithm. First, we introduce an implicit enumeration technique. By applying the technique to existing (1 - 1/e)- approximation algorithm, we obtain (1- k-1/(k-1)e+1 )-approximation algorithm when a root has k children. In case of ternary trees, k ≥ 3 and thus the approximation ratio satisfies (1 - k-1/(k-1)e+1 ) ≥ 0.6892, which improves the existing result 1 - 1/e ≥ 0.6321. Second technique is based on backward induction and improves an approximation algorithm for firefighter problem on ternary trees. If we apply the technique to existing (1-1/e)-approximation algorithm, we obtain 0.6976-approximation algorithm. Lastly, we combine the above two techniques and obtain 0.7144-approximation algorithm for firefighter problem on ternary trees.

元の言語英語
ページ(範囲)196-199
ページ数4
ジャーナルIEICE Transactions on Information and Systems
E94-D
発行部数2
DOI
出版物ステータス出版済み - 2 2011
外部発表Yes

Fingerprint

Approximation algorithms
Computer viruses
Fires

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

これを引用

Improved approximation algorithms for firefighter problem on trees. / Iwaikawa, Yutakaa; Kamiyama, Naoyuki; Matsui, Tomomi.

:: IEICE Transactions on Information and Systems, 巻 E94-D, 番号 2, 02.2011, p. 196-199.

研究成果: ジャーナルへの寄稿記事

@article{2b4d0c770bdf445a9a519234d83367ce,
title = "Improved approximation algorithms for firefighter problem on trees",
abstract = "The firefighter problem is used to model the spread of fire, infectious diseases, and computer viruses. This paper deals with firefighter problem on rooted trees. It is known that the firefighter problem is NPhard even for rooted trees of maximum degree 3. We propose techniques to improve a given approximation algorithm. First, we introduce an implicit enumeration technique. By applying the technique to existing (1 - 1/e)- approximation algorithm, we obtain (1- k-1/(k-1)e+1 )-approximation algorithm when a root has k children. In case of ternary trees, k ≥ 3 and thus the approximation ratio satisfies (1 - k-1/(k-1)e+1 ) ≥ 0.6892, which improves the existing result 1 - 1/e ≥ 0.6321. Second technique is based on backward induction and improves an approximation algorithm for firefighter problem on ternary trees. If we apply the technique to existing (1-1/e)-approximation algorithm, we obtain 0.6976-approximation algorithm. Lastly, we combine the above two techniques and obtain 0.7144-approximation algorithm for firefighter problem on ternary trees.",
author = "Yutakaa Iwaikawa and Naoyuki Kamiyama and Tomomi Matsui",
year = "2011",
month = "2",
doi = "10.1587/transinf.E94.D.196",
language = "English",
volume = "E94-D",
pages = "196--199",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "2",

}

TY - JOUR

T1 - Improved approximation algorithms for firefighter problem on trees

AU - Iwaikawa, Yutakaa

AU - Kamiyama, Naoyuki

AU - Matsui, Tomomi

PY - 2011/2

Y1 - 2011/2

N2 - The firefighter problem is used to model the spread of fire, infectious diseases, and computer viruses. This paper deals with firefighter problem on rooted trees. It is known that the firefighter problem is NPhard even for rooted trees of maximum degree 3. We propose techniques to improve a given approximation algorithm. First, we introduce an implicit enumeration technique. By applying the technique to existing (1 - 1/e)- approximation algorithm, we obtain (1- k-1/(k-1)e+1 )-approximation algorithm when a root has k children. In case of ternary trees, k ≥ 3 and thus the approximation ratio satisfies (1 - k-1/(k-1)e+1 ) ≥ 0.6892, which improves the existing result 1 - 1/e ≥ 0.6321. Second technique is based on backward induction and improves an approximation algorithm for firefighter problem on ternary trees. If we apply the technique to existing (1-1/e)-approximation algorithm, we obtain 0.6976-approximation algorithm. Lastly, we combine the above two techniques and obtain 0.7144-approximation algorithm for firefighter problem on ternary trees.

AB - The firefighter problem is used to model the spread of fire, infectious diseases, and computer viruses. This paper deals with firefighter problem on rooted trees. It is known that the firefighter problem is NPhard even for rooted trees of maximum degree 3. We propose techniques to improve a given approximation algorithm. First, we introduce an implicit enumeration technique. By applying the technique to existing (1 - 1/e)- approximation algorithm, we obtain (1- k-1/(k-1)e+1 )-approximation algorithm when a root has k children. In case of ternary trees, k ≥ 3 and thus the approximation ratio satisfies (1 - k-1/(k-1)e+1 ) ≥ 0.6892, which improves the existing result 1 - 1/e ≥ 0.6321. Second technique is based on backward induction and improves an approximation algorithm for firefighter problem on ternary trees. If we apply the technique to existing (1-1/e)-approximation algorithm, we obtain 0.6976-approximation algorithm. Lastly, we combine the above two techniques and obtain 0.7144-approximation algorithm for firefighter problem on ternary trees.

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

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

U2 - 10.1587/transinf.E94.D.196

DO - 10.1587/transinf.E94.D.196

M3 - Article

AN - SCOPUS:79951507164

VL - E94-D

SP - 196

EP - 199

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 2

ER -