A constrained minimum spanning tree problem

DOI10.1016/S0305-0548(99)00061-1zbMath0959.90040OpenAlexW2017797336MaRDI QIDQ1571033

Guangting Chen, Guo-Chuan Zhang

Publication date: 2 May 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00061-1

zbMATH Keywords

algorithmspanning treedivide-and-conquer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (6)

On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) ⋮ On the restricted 1-Steiner tree problem ⋮ The cable trench problem: Combining the shortest path and minimum spanning tree problems ⋮ Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem ⋮ \(1\)-line minimum rectilinear Steiner trees and related problems ⋮ On the restricted \(k\)-Steiner tree problem

Cites Work

• The 1-steiner tree problem
• Unnamed Item

This page was built for publication: A constrained minimum spanning tree problem