Geometry-experiment algorithm for Steiner minimal tree problem

DOI10.1155/2013/367107zbMath1268.65085WikidataQ59005583 ScholiaQ59005583MaRDI QIDQ2375521

Zong-Xiao Yang, Yanping Gao, Xiaoyao Jia, Jie-Yu Hao

Publication date: 14 June 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/367107

zbMATH Keywords

Delaunay diagram; Steiner minimal tree problem; Geo-Steiner algorithm; geometry algorithm; geometry-experiment algorithm; nonlinear combinatorial optimization problems; system shortest path; visualization experiment

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C35: Extremal problems in graph theory

65K05: Numerical mathematical programming methods

90C27: Combinatorial optimization

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Differential quadrature Trefftz method for Poisson-type problems on irregular domains
• Using a conic formulation for finding Steiner minimal trees
• Study on the stability of Steiner tree structure of explosion-proof textiles
• A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
• New approximation algorithms for the Steiner tree problems
• On the Problem of Steiner
• Analysis of axisymmetric free vibration of isotropic shallow spherical sheels with a circular hole
• Steiner Minimal Trees
• The Generation of Minimal Trees with a Steiner Topology