On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem

DOI10.1016/0307-904X(80)90163-8zbMath0447.05025OpenAlexW2115786121MaRDI QIDQ1146193

Judith S. Liebman, James MacGregor Smith

Publication date: 1980

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0307-904x(80)90163-8

zbMATH Keywords

algorithmVoronoi diagramsSteiner tree

Mathematics Subject Classification ID

Trees (05C05) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem

Cites Work

• On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem
• Flows in transportation networks
• Generalization of Voronoi Diagrams in the Plane
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• Low cost drainage networks
• Finding optimum branchings
• The Single Source Weber Problem -- Survey and Extensions
• The Three Factory Problem
• A Geometrical Solution of the Three Factory Problem
• Optimum branchings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem