Results 51 to 60 of about 41,748 (161)
Algorithms for the minimum spanning tree problem with resource allocation
Operations Research Perspectives, 2016 We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality.
Seiji Kataoka, Takeo Yamada
doaj +1 more source
The Minimum Spanning Tree Problem on networks with Neutrosophic numbers [PDF]
Neutrosophic Sets and SystemsThe minimum spanning tree problem (MSTP) revolves around creating a spanning tree (ST) within a graph/network that incurs the least cost compared to all other potential STs.
Kalyan Adhikary +2 more
doaj +1 more source
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +1 more source
Micro-cluster Structure Clustering Based on Weight-Constrained Minimum Spanning Tree
Data Science and EngineeringCurrently, it is a challenging problem to make clustering algorithms suitable for arbitrary distributions of data. In this paper, we propose a Micro-cluster Structure Clustering algorithm based on the Weight-constrained Minimum Spanning Tree, called MSC ...
Jiaman Ding +3 more
doaj +1 more source
Spanning Trees Minimizing Branching Costs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj +1 more source
Infinity Jurnal Matematika dan Aplikasinya, 2020 Penelitian ini bertujuan untuk menentukan pohon merentang minimum (Minimum Spanning Tree) terhadap lintasan yang mengarah ke Pusat Perbelanjaan di Kota Palopo menggunakan Algoritma Semut.
Fatimah Fatimah, Marwan Sam
doaj
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2012 One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj +1 more source
Average Case Analysis of the MST-heuristic for the Power Assignment Problem: Special Cases
EAI Endorsed Transactions on Energy Web, 2016 We present an average case analysis of the minimum spanning tree heuristic for the power assignment problem. The worst-case approximation ratio of this heuristic is 2.
Maurits de Graaf +3 more
doaj +1 more source
Outlier detection using iterative adaptive mini-minimum spanning tree generation with applications on medical data. [PDF]
Front Physiol, 2023 Li J +5 more
europepmc +1 more source
A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem. [PDF]
Entropy (Basel), 2022 Zhang S, Mao J, Wang N, Li D, Ju C.
europepmc +1 more source