Skip to main content
Conference Proceedings

An approximation scheme for some steiner tree problems in the plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 834 LNCS 414-422
DOI: 10.1007/3-540-58325-4_206
2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We design a polynomial time approximation scheme for the Steiner tree problem in the plane when the given set of regular points is c-local. The construction works for both Euclidean and rectilinear metrics.

Cite

CITATION STYLE

APA

Jiang, T., & Wang, L. (1994). An approximation scheme for some steiner tree problems in the plane. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 414–422). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_206

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free