scientific article; zbMATH DE number 1302181

MaRDI QIDQ4247448zbMATH OpenFDO

Authors F. Harris

Publication date 21 March 2000

zbMATH Keywords

parallel algorithmSteiner minimal trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 1339503
• Exact computation of Steiner minimal trees in the plane
• scientific article; zbMATH DE number 1161295
• How to find Steiner minimal trees in Euclidean \(d\)-space

Cited in

(6)

• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
• Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³
• scientific article; zbMATH DE number 1161295 (Why is no real title available?)
• A parallel algorithm for computing Steiner trees in strongly chordal graphs
• Exact computation of Steiner minimal trees in the plane
• On Steiner trees and minimum spanning trees in hypergraphs

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication:

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