Study on the Problem of Constrained Minimum Spanning Tree(约束最小生成树问题研究)

本文对约束最小生成树问题提出一个算法，它的计算复杂性是O(n3).然后把约束最小生成树作为约束Steiner最小树的一个近似解，则近似解的性能比为.

Bibliographic Details
Main Authors:	CHENGuang-ting(陈光亭), ZHANGGuo-chuan(张国川)
Format:	Article
Language:	zho
Published:	Zhejiang University Press 1999-01-01
Series:	Zhejiang Daxue xuebao. Lixue ban
Subjects:	生成树 steiner树近似算法性能比
Online Access:	https://doi.org/zjup/1008-9497.1999.26.2.28-32

Internet