Publikationsansicht

An O(n log n) Approximation Scheme for Steiner Tree in Planar Graphs (2007)

Abstract

We give an O(n log n) approximation scheme for the Steiner tree problem in planar graphs. 1

Details der Publikation

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.136.6094
Quelle	http://www.math.uwaterloo.ca/~glencora/downloads/steinertree-full.pdf
Mitarbeiter	CiteSeerX
Archiv	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Typ	text
Sprache	Englisch
Verknüpfungen	10.1.1.44.1065, 10.1.1.37.9384, 10.1.1.30.362, 10.1.1.35.985, 10.1.1.44.9650, 10.1.1.81.8138, 10.1.1.45.3754, 10.1.1.133.4154, 10.1.1.115.3559