On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)

DOI10.1007/s11590-020-01627-7zbMath1466.90116OpenAlexW3048039108WikidataQ114222159 ScholiaQ114222159MaRDI QIDQ828689

Junran Lichen, Wencheng Wang, Jianping Li, Yujie Zheng

Publication date: 5 May 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01627-7

zbMATH Keywords

Steiner pointsapproximation algorithmsDelaunay triangulationSteiner treea fixed line \(l\)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• A faster circle-sweep Delaunay triangulation algorithm
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• A constrained minimum spanning tree problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Generalised \(k\)-Steiner tree problems in normed planes
• Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Efficient algorithms for a family of matroid intersection problems
• The 1-steiner tree problem
• A good algorithm for smallest spanning trees with a degree constraint
• Fibonacci heaps and their uses in improved network optimization algorithms
• Combinatorial optimization. Theory and algorithms
• Steiner tree problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)