Cherng Chin

Learn More
We give a family of examples on which a large class C of "minimum spanning tree-based" rectilinear Steiner tree heuristics has performance ratio arbitrarily close to 3/2 times optimal. The class C contains many published heuristics whose worst-case performance ratio , were previously unknown. Of particular interest is that C contains two heuristics whose(More)
SUMMARY Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A w-container C(u, v) of G is a w *-container if it contains all the vertices of G. A graph G is w *-connected if there exists a w *-container between any(More)
  • 1