Kunlun Tan

Learn More
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph G = (V, E), a set of terminals R ⊆ V , and non-negative costs c e for all edges e ∈ E. Any tree that contains all terminals is called a Steiner tree; the goal is to find a(More)
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. Abstract The Steiner tree problem is a classical, well-studied, N P-hard optimization problem. Here we are given an(More)
  • 1