scientific article; zbMATH DE number 1302181

zbMATH Open0932.90045MaRDI QIDQ4247448FDOQ4247448

Authors: F. Harris 

Publication date: 21 March 2000

Title of this publication is not available (Why is that?)

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

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)

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³
• Title not available (Why is that?)
• 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

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)