Results 1 to 10 of about 128,042 (286)
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants [PDF]
Data in Brief, 2023 This article proposes a benchmark instance generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. The generator is developed in C++ and does not uses external
Iago A. Carvalho, Amadeu A. Coco
doaj +2 more sources
A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem [PDF]
Entropy, 2022 The quadratic minimum spanning tree problem (QMSTP) is a spanning tree optimization problem that considers the interaction cost between pairs of edges arising from a number of practical scenarios.
Shufan Zhang +4 more
doaj +2 more sources
Diameter Constrained Fuzzy Minimum Spanning Tree Problem [PDF]
International Journal of Computational Intelligence Systems, 2013 In this paper, we have studied the constrained version of the fuzzy minimum spanning tree problem. Costs of all the edges are considered as fuzzy numbers.
Sk. Md. Abu Nayeem, Madhumangal Pal
doaj +3 more sources
The generalized minimum spanning tree problem [PDF]
, 2000 We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard.
Kern, W., Pop, P.C., Still, G.J.
core +5 more sources
The Budgeted Labeled Minimum Spanning Tree Problem
MathematicsIn order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli +3 more
doaj +3 more sources
Minimum Spanning Tree Cycle Intersection problem [PDF]
Discrete Applied Mathematics, 2021 Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. We consider the problem of finding a spanning tree that has the least number of such non-empty intersections.
Manuel Dubinsky +2 more
openaire +4 more sources
Some models for inverse minimum spanning tree problem with uncertain edge weights [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2022 The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights ...
Sagarika Biswal, Ganesh Ghorai
doaj +1 more source
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications, 2021 We investigate the problem of finding a spanning tree of a set of $n$ moving points in $\mathbb{R}^{\dim}$ that minimizes the maximum total weight (under any convex distance function) or the maximum bottleneck throughout the motion. The output is a single tree, i.e., it does not change combinatorially during the movement of the points.
Akitaya, Hugo A. +6 more
openaire +1 more source
Determining hop-constrained spanning trees with repetitive heuristics
Journal of Telecommunications and Information Technology, 2023 The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges.
Manuela Fernandes +2 more
doaj +1 more source
The Minimum-Area Spanning Tree Problem [PDF]
Computational Geometry, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carmi, Paz +2 more
openaire +2 more sources