A constrained minimum spanning tree problem

Computers and Operations Research

Volumn 27, Issue 9, 2000, Pages 867-875

  Chen, Guangting ^a   Zhang, Guochuan ^b  

^a HANGZHOU DIANZI UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Algorithm; Divide and conquer; Spanning tree

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

CONSTRAINED MINIMUM SPANNING TREE PROBLEM (CMSTP); DIVIDE-AND-CONQUER METHOD;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0034028742     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00061-1     Document Type: Article

References (2)

1. Preparata FP, Shamos MI. Computational Geometry - An Introduction. New York: Springer, 1985.
2. G. Georgakopoulos, C. Papadimitriou, The 1-Steiner tree problem. Journal of Algorithms 1987;8:122-30.