Exact Algorithms for the Steiner Tree Problem

Exact Algorithms for the Steiner Tree Problem (2008)

by Xinhui Wang

@MISC{Wang08exactalgorithms,
    author = {Xinhui Wang},
    title = {Exact Algorithms for the Steiner Tree Problem},
    year = {2008}
}

93	An 11/6-approximation algorithm for the network Steiner problem - Zelikovsky
92	Exact algorithms for NP-hard problems: a survey - WOEGINGER - 2003
52	A dual ascent approach for steiner tree problems on a directed graph - Wong - 1981
26	A series of approximation algorithms for the acyclic directed Steiner tree problem, Algorithmica, 18: 99-110, 1997. This thesis presents the main results of my research which was carried out at the DMMP group at University of Twente, and was financially s - Zelikovsky
25	Rectilinear full Steiner tree generation - Zachariasen - 1999
21	Path-distance heuristics for the steiner problem in undirected networks - Winter, Smith - 1992
6	Open problems around exact algorithms - Woeginger
6	The rectilinear Steiner tree problem: a tutorial, in:Steiner Trees - Zachariasen
3	Concatenation-based greedy heuristics for the Steiner tree problem in the Euclidean plane - Zachariasen, Winter - 1999
2	Large Euclidean Steiner minimum trees in an hour, ISMP - Winter, Zachariasen - 1997
1	2008. the Author Xinhui Wang was born on February 11, 1978, Ruyang County of Henan Province, China. He finished his elementary education at Yan-shi High School in 1995. He spent four years in the Dept - Enschede