Minimum spanning treeMSTCluster validity measureSingle linkageGenie algorithmMutual informationMinimum spanning trees (MSTs) provide a convenient representation of datasets in numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this paper, we quantify the extent to ...
can also be applied to the MSST and the 2CP. We will refer to the diameter of the MDST of P as the tree diameter of P and we will abbreviate the minimum-diameter monopolar spanning tree by MDmST—analogously to the MDdST. 2 The Minimum-Sum Dipolar Spanning Tree ...
It is a special case of the Quadratic Minimum Spanning Tree Problem (QMSTP), for which quadratic costs are also applicable to pairs of non-adjacent edges. Both were first investigated by Assad and Xu (1992) and proven to be NP-Hard. QMSTP formulations, exact algorithms and heuristics were...
Then the QBSTP is to find a spanning tree T of G such that max{wef:e,f∈T} is as small as possible. Zhang and Punnen [6], [7] consider the feasibility version of MSTC to develop exact and heuristic algorithms for the quadratic bottleneck spanning tree problem and it is the primary...
(2013). Critical edges/nodes for the minimum spanning tree problem: Complexity and approximation. Journal of Combinatorial Optimization, 26(1), 178–189. Google Scholar Butenko, S., & Wilhelm, W. (2006). Clique-detection models in computational biochemistry and genomics. European Journal of ...
Approximation algorithms for combinatorial optimization: 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedingsJ. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wolff, Facility location and the geometric minimum-diameter spanning tree, in Proc. ...
A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation[J]. Biosystems, 2013, 114: 1-7.Z.C. Wang, D.M. Huang, H.J. Meng, C.P Tang, A new fast algorithm for solving the minimum spanning treeproblem based on DNA molecules computation, ...
We develop algorithms that filter the domains of all variables to bound consistency.doi:10.1007/11889205_13Grégoire DoomsIrit KatrielSpringer-VerlagInternational Conference on Principles & Practice of Constraint ProgrammingDooms, G., Katriel, I.: The minimum spanning tree constraint. In: Benhamou, F....
Wolff, Facility location and the geometric minimum-diameter spanning tree, in Proc. 5th International Workshop on Approx. Algorithms for Comb. Opt. (APPROX) (2002), 146-160.J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wolff. Facility location and the geometric minimum...
M. Leitner, "Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem," Computers & Operations Research, vol. 65, pp. 1 - 18, 2016. 77Leitner, M.: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning ...