Bottleneck Steiner tree with bounded number of Steiner vertices

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz

Research output: Contribution to journalArticlepeer-review

Abstract

Given a complete graph G=(V,E), where each vertex is labeled either terminal or Steiner, a distance function (i.e., a metric) d:E→R+, and a positive integer k, we study the problem of finding a Steiner tree T spanning all terminals and at most k Steiner vertices, such that the length of the longest edge is minimized. We first show that this problem is NP-hard and cannot be approximated within a factor of 2-ε, for any ε>0, unless P=NP. Then, we present a polynomial-time 2-approximation algorithm for this problem.

Original languageAmerican English
Pages (from-to)96-100
Number of pages5
JournalJournal of Discrete Algorithms
Volume30
DOIs
StatePublished - 1 Jan 2015

Keywords

  • Approximation algorithms
  • Bottleneck Steiner tree
  • NP-hardness

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Bottleneck Steiner tree with bounded number of Steiner vertices'. Together they form a unique fingerprint.

Cite this