Constructing min-cost single failure immune recovery trees: Computational complexity and approximation algorithms

Xi Fang, Dejun Yang, Guoliang Xue, Krishnaiyan Thulasiraman

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

Abstract

In this paper, we study the problem of constructing min-cost single-link/node failure immune recovery trees for two-edge/vertex connected networks. We prove its NP-hardness, and present a general framework of efficient approximation algorithms for solving this problem. Based on this framework, we present two realizations: 1) for link failure protection, our realization has an approximation ratio of 2 and O(nlog n(m +nlogn)) running time if different links have different costs, or an approximation ratio of 1.5 and a linear running time if all links have the same cost; 2) for node failure protection, our realization has an approximation ratio of 2 and O(n3m) running time if different links have different costs, or an approximation ratio of 5/3 and a linear running time if all links have the same cost.

Original languageEnglish (US)
Title of host publication2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2010
Pages55-57
Number of pages3
DOIs
StatePublished - Dec 1 2010
Event2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2010 - Mumbai, India
Duration: Dec 16 2010Dec 18 2010

Publication series

NameInternational Symposium on Advanced Networks and Telecommunication Systems, ANTS
ISSN (Print)2153-1684

Other

Other2010 IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2010
CountryIndia
CityMumbai
Period12/16/1012/18/10

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Fingerprint Dive into the research topics of 'Constructing min-cost single failure immune recovery trees: Computational complexity and approximation algorithms'. Together they form a unique fingerprint.

Cite this