Presentation 1999/10/25
Algorithms for finding noncrossing Steiner forests in plane graphs
Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Let G=(V, E) be a plane graph with nonnegative edge length, let N={N_1,N_2,・・・,N_k}be a family of k vertex subsets, called nets. Then a noncrossing Steiner forest for N in G is a set T of k trees T_1,T_2,・・・,T_k in G such that each tree T_i∈T connects all vertices in N_i, any two trees in T do not cross each other, and the sum of edge lengths of all trees is minimum. In this paper we give an efficient algorithm to find a noncrossing Steiner forest in a plane graph G for the case where all vertices in nets lie on any two of the face boundaries of G. The algorithm takes time O(n log n) if G has n vertices and each net contains a bounded number of vertices.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) plane graph / Steiner tree / noncrossing / algorithm
Paper # COMP99-40
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Algorithms for finding noncrossing Steiner forests in plane graphs
Sub Title (in English)
Keyword(1) plane graph
Keyword(2) Steiner tree
Keyword(3) noncrossing
Keyword(4) algorithm
1st Author's Name Yoshiyuki Kusakari
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Daisuke Masubuchi
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Takao Nishizeki
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 1999/10/25
Paper # COMP99-40
Volume (vol) vol.99
Number (no) 388
Page pp.pp.-
#Pages 8
Date of Issue