Bottleneck steiner tree with bounded number of steiner vertices

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

Bottleneck steiner tree with bounded number of steiner vertices

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

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

Given a complete graph G = (V,E), where each vertex is labeled either terminal or Steiner, a distance function 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 2-ε, for any ε > 0, unless P = NP. Then, we present a polynomial-time 2-approximation algorithm for this problem.

Original language	English
State	Published - 1 Dec 2011
Event	23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 - Toronto, ON, Canada Duration: 10 Aug 2011 → 12 Aug 2011

Conference

Conference	23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
Country/Territory	Canada
City	Toronto, ON
Period	10/08/11 → 12/08/11

ASJC Scopus subject areas

Computational Mathematics
Geometry and Topology

Cite this

@conference{260d1ee5390d48ada69b466bdcd5771c,

title = "Bottleneck steiner tree with bounded number of steiner vertices",

abstract = "Given a complete graph G = (V,E), where each vertex is labeled either terminal or Steiner, a distance function 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 2-ε, for any ε > 0, unless P = NP. Then, we present a polynomial-time 2-approximation algorithm for this problem.",

author = "{Karim Abu-Affash}, A. and Paz Carmi and Katz, {Matthew J.}",

year = "2011",

month = dec,

day = "1",

language = "English",

note = "23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 ; Conference date: 10-08-2011 Through 12-08-2011",

}

TY - CONF

T1 - Bottleneck steiner tree with bounded number of steiner vertices

AU - Karim Abu-Affash, A.

AU - Carmi, Paz

AU - Katz, Matthew J.

PY - 2011/12/1

Y1 - 2011/12/1

N2 - Given a complete graph G = (V,E), where each vertex is labeled either terminal or Steiner, a distance function 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 2-ε, for any ε > 0, unless P = NP. Then, we present a polynomial-time 2-approximation algorithm for this problem.

AB - Given a complete graph G = (V,E), where each vertex is labeled either terminal or Steiner, a distance function 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 2-ε, for any ε > 0, unless P = NP. Then, we present a polynomial-time 2-approximation algorithm for this problem.

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

M3 - Paper

AN - SCOPUS:84882993799

T2 - 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

Y2 - 10 August 2011 through 12 August 2011

ER -

Bottleneck steiner tree with bounded number of steiner vertices

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this