Grade of service Steiner minimum trees in the Euclidean plane

DOI10.1007/S00453-001-0050-6MaRDI QIDQ5953596zbMATH OpenOpenAlexFDO

Authors Guoliang Xue, Guohui Lin, Du Ding-Zhu

Publication date 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0050-6

zbMATH Keywords

grade of serviceapproximative algorithmEuclidean Steiner minimum trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Communication networks in operations research (90B18)

Recommendations

• Publication:4945799
• The Steiner tree problem
• An algorithm for the steiner problem in the euclidean plane
• On better heuristics for Steiner minimum trees
• scientific article; zbMATH DE number 3918122

Cited in

(6)

• A PTAS for weight constrained Steiner trees in series--parallel graphs.
• Multi-level Steiner trees
• Multi-Level Steiner Trees.
• A polynomial time approximation scheme for the grade of service Steiner minimum tree problem
• Approximation algorithms for priority Steiner tree problems
• scientific article; zbMATH DE number 1424550 (Why is no real title available?)

This page was built for publication: Grade of service Steiner minimum trees in the Euclidean plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953596)