Results 21 to 30 of about 128,042 (286)
Utilization of the Prim Algorithm to Determine the Nearest Path Car Transportation Problems of Goods Carrier Box [PDF]
ITM Web of Conferences, 2022 Prim’s algorithm has been proven to be able to be used in determining the closest path, minimum spanning tree in the problem of transporting box cars carrying goods.
Paryati, Krit Salahddine
doaj +1 more source
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources
Fully Retroactive Minimum Spanning Tree Problem
The Computer Journal, 2020 Abstract This article describes an algorithm that solves a fully dynamic variant of the minimum spanning tree (MST) problem. The fully retroactive MST allows adding an edge to time $t$, or to obtain the current MST at time $t$. By using the square root technique and a data structure link-cut tree, it was possible to obtain an algorithm ...
José Wagner de Andrade Júnior +1 more
openaire +1 more source
Efficient optimization of the Held–Karp lower bound
Open Journal of Mathematical Optimization, 2021 Given a weighted undirected graph $G=(V,E)$, the Held–Karp lower bound for the Traveling Salesman Problem (TSP) is obtained by selecting an arbitrary vertex $\bar{p} \in V$, by computing a minimum cost tree spanning $V \backslash \lbrace \bar{p}\rbrace $
Righini, Giovanni
doaj +1 more source
Reload cost problems: minimum diameter spanning tree
Discrete Applied Mathematics, 2001 This paper is concerned with a special optimization problem on an edge-colored graph. Given a reload cost function on pairs of colours, reload cost distance is defined for a path of the graph. The problem is to find a spanning tree of the graph such that the path with maximal reload cost distance (diameter) is minimized on all spanning trees ...
Wirth, Hans-Christoph, Steffan, Jan
openaire +2 more sources
A polyhedral approach to the generalized minimum labeling spanning tree problem
EURO Journal on Computational Optimization, 2019 The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels.
ThiagoGouveiada Silva +4 more
doaj +1 more source
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident.
Han-Suk Sohn, Dennis Bricker
doaj
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Journal of Applied Mathematics, 2012 Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj +1 more source
BUILDING MINIMUM SPANNING TREES BY LIMITED NUMBER OF NODES OVER TRIANGULATED SET OF INITIAL NODES
Information and Telecommunication Sciences, 2023 Background. The common purpose of modelling and using minimum spanning trees is to ensure efficient coverage. In many tasks of designing efficient telecommunication networks, the number of network nodes is usually limited. In terms of rational allocation,
Вадим Романюк
doaj +1 more source
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game [PDF]
, 2014 Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$ of \emph{red} edges and a set $B$ of \emph{blue} edges, and assume that red edges are weighted and form a spanning tree of $G$. Then, the \emph{Stackelberg Minimum Spanning Tree}
Bilò, Davide +3 more
core +2 more sources