On approximation algorithms for Steiner's problem in graphs

Authors:
P Widmayer
Affiliations:
-
Venue:
International Workshop WG '86 on Graph-theoretic concepts in computer science
Year:
1987

Citing 0
Cited 3

A polynomial-time approximation scheme for Steiner tree in planar graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An O(n log n) approximation scheme for Steiner tree in planar graphs

ACM Transactions on Algorithms (TALG)
Steiner tree in planar graphs: an O(n log n) approximation scheme with singly-exponential dependence on epsilon

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract