Finding Steiner forests in planar graphs

Authors:
Hitoshi Suzuki;Takehiro Akama;Takao Nishizeki
Affiliations:
Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai 980, Japan;Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai 980, Japan;Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai 980, Japan
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

When trees collide: an approximation algorithm for the generalized Steiner problem on networks

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The vertex-disjoint menger problem in planar graphs

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient algorithms for finding disjoint paths in grids

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Image-guided maze construction

ACM SIGGRAPH 2007 papers
Shortest vertex-disjoint two-face paths in planar graphs

ACM Transactions on Algorithms (TALG)

Hi-index	0.00