MAX-SNP hardness and approximation of selected-internal steiner trees

Sun Yuan Hsieh, Shih Cheng Yang

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

Abstract

In this paper, we consider an interesting variant of the well-known Steiner tree problem: Given a complete graph G = (V, E) with a cost function c : E → R+ and two subsets R and R′ satisfying R′ ⊂ R ⊆ V, a selected-internal Steiner tree is a Steiner tree which contains (or spans) all the vertices in R such that each vertex in R′ cannot be a leaf. The selected-internal Steiner tree problem is to find a selected-internal Steiner tree with the minimum cost. In this paper, we show that the problem is MAX SNP-hard even when the costs of all edges in the input graph are restricted to either 1 or 2. We also present an approximation algorithm for the problem.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
PublisherSpringer Verlag
Pages449-458
Number of pages10
ISBN (Print)3540369252, 9783540369257
DOIs
Publication statusPublished - 2006 Jan 1
Event12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, Taiwan
Duration: 2006 Aug 152006 Aug 18

Publication series

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

Other

Other12th Annual International Conference on Computing and Combinatorics, COCOON 2006
CountryTaiwan
CityTaipei
Period06-08-1506-08-18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'MAX-SNP hardness and approximation of selected-internal steiner trees'. Together they form a unique fingerprint.

Cite this