VIET NAM NATIONAL UNIVERSITY - HO CHI MINH CITY

INTERNATIONAL UNIVERSITY
DEPARTMENT OF MATHEMATICS

PROJECT REPORT

OPTIMIZATION 2

The minimum spanning tree problem

Lecturer: Prof. Nguyen Dinh

Group members: Nguyễn Gia An MAMAIU21036
Nguyễn Vo Duy Anh MAMAIU19022
Lê Thị Kiều Anh MAMAIU21059
Trân Hoang Gia Ân MAMAIU17037
Nguyên Ngoc Minh Châu MAMAIU21061
Nguyễn Ngọc Kim Chi MAMAIU20034
Trần Hoàng Duy MAMAIU20034
 International University, Ho Chi Minh City
Department of Mathematics

Contents
1 Introdution 3

2 Concept of Minimum Spanning Tree 3

3 Algorithm 4

4 Practical problem 5

5 Conclusion 10

Spring Semester 2024 Page 2/10

 International University, Ho Chi Minh City
Department of Mathematics

1 Introdution
In the realm of graph theory, a Minimum Spanning Tree (MST) represents a fundamental concept with
significant applications across various fields, including computer science, network design, and optimization. A
spanning tree of a connected, undirected graph is a subgraph that includes all the vertices of the original graph
while maintaining the minimum number of edges necessary to connect them without forming any cycles. The
"minimum" aspect refers to the total weight of the edges in the spanning tree, which is minimized compared to
all other possible spanning trees of the graph.
The importance of MSTs arises in numerous practical scenarios. For instance, they are pivotal in designing
efficient network layouts, such as telecommunications and computer networks, where the goal is to connect a
set of points (nodes) with the least amount of wiring or cost. In transportation, MSTs can help determine the
most efficient routes for connecting various locations, thereby reducing travel time and expenses. Additionally,
MSTs play a crucial role in clustering algorithms in data mining, where they assist in grouping similar data
points based on distance metrics.
This report will set the stage for a deeper exploration of the Minimum Spanning Tree, including its defini-
tion, properties, algorithm for computation, and the practical exercise. Understanding MSTs not only enriches
the study of graph theory but also equips practitioners with valuable tools for tackling complex optimization
challenges in various domains.

2 Concept of Minimum Spanning Tree

In network optimization, the minimal spanning tree (MST) problem is a key idea. It entails identifying a
subset of edges in an undirected, linked graph that joins every vertex with the fewest feasible total edge weights
and no cycles. The main points of the MST problem as they are presented in the reference literature will be
discussed here.

Definition and Properties

A spanning tree of a graph is a subgraph that includes all the vertices of the original graph, is connected,
and has no cycles. A minimum spanning tree is a spanning tree with the smallest possible sum of edge
weights. Given a graph G = (V, E), where V is the set of vertices and E is the set of edges with associated
weights, the objective is to find a spanning tree that minimizes the total edge weight.
Key properties of spanning trees include:

1. Number of Edges: A spanning tree with n vertices always has n − 1 edges.

2. Uniqueness: If all edge weights are distinct, the MST is unique. Otherwise, there can be multiple MSTs
with the same total weight.

Spring Semester 2024 Page 3/10

 International University, Ho Chi Minh City
Department of Mathematics

Applications
The MST problem has numerous practical applications, including:

• Design of Communication Networks: Minimizing the cost of laying out cables or fiber optics to
connect a set of locations.

• Transportation Networks: Designing road systems or pipelines with minimal construction costs.

• Electrical Networks: Connecting components with minimal wiring.

3 Algorithm
• Step 1: Select any node arbitrarily, and then connect it (i.e., add a link) to the nearest distinct node.

• Step 2: Identify the unconnected node that is closest to a connected node, and then connect these two
nodes (i.e., add a link between them). Repeat this step until all nodes have been connected.

• Step 3: Tie breaking: Ties for the nearest distinct node (step 1) or the closest unconnected node (step 2)
may be broken arbitrarily, and the algorithm must still yield an optimal solution. However, such ties are
a signal that there may be (but need not be) multiple optimal solutions. All such optimal solutions can
be identified by pursuing all ways of breaking ties to their conclusion.

Spring Semester 2024 Page 4/10

 International University, Ho Chi Minh City
Department of Mathematics

4 Practical problem
Finding the minimum spanning tree for the network below.

Figure 1

Set C0 = ∅, C0 = {0, 1, 2, 3, 4, 5, 6, 7, 8}

• Iteration 1: For any node in a network, the algorithm we choose will start at node 0, which gives:

C1 = {0}, C1 = {1, 2, 3, 4, 5, 6, 7, 8}

• Iteration 2: (0, 1) is the shortest link compared to other links from node 0 to any node belonging to the
unconnected set C1 . Hence, link (0, 1) is permanently made and j ∗ = 1, which yields:

C2 = {0, 1}, C2 = {2, 3, 4, 5, 6, 7, 8}

Spring Semester 2024 Page 5/10

 International University, Ho Chi Minh City
Department of Mathematics

Figure 2

• Iteration 3: From the set C2 , select node 2 that yields the shortest arc to a node in the connected set
C2 , that is j ∗ = 2:
C3 = {0, 1, 2}, C3 = {3, 4, 5, 6, 7, 8}

Figure 3

• Iteration 4: From the set C3 , select node 8 that yields the shortest arc to a node in the connected set
C3 , that is j ∗ = 8:
C4 = {0, 1, 2, 8}, C4 = {3, 4, 5, 6, 7}

Spring Semester 2024 Page 6/10

 International University, Ho Chi Minh City
Department of Mathematics

Figure 4

• Iteration 5: From the set C4 , select node 5 that yields the shortest arc to a node in the connected set
C4 , that is j ∗ = 5:
C5 = {0, 1, 2, 8, 5}, C5 = {3, 4, 6, 7}

Figure 5

• Iteration 6: From the set C5 , select node 6 that yields the shortest arc to a node in the connected set
C5 , that is j ∗ = 6:
C6 = {0, 1, 2, 8, 5, 6}, C6 = {3, 4, 7}

• Iteration 7: From the set C6 , select node 7 that yields the shortest arc to a node in the connected set

Spring Semester 2024 Page 7/10

 International University, Ho Chi Minh City
Department of Mathematics

Figure 6

C6 , that is j ∗ = 7:
C7 = {0, 1, 2, 8, 5, 6, 7}, C7 = {3, 4}

Figure 7

• Iteration 8: From the set C7 , select node 3 that yields the shortest arc to a node in the connected set
C7 , that is j ∗ = 3:
C8 = {0, 1, 2, 8, 5, 6, 7, 3}, C8 = {4}

Spring Semester 2024 Page 8/10

 International University, Ho Chi Minh City
Department of Mathematics

Figure 8

• Iteration 9: From the set C8 , select node 4 that yields the shortest arc to a node in the connected set
C8 , that is j ∗ = 4:
C9 = {0, 1, 2, 8, 5, 6, 7, 3, 4}, C9 = ∅

Figure 9

Hence, we obtain the minimal spanning tree.

Spring Semester 2024 Page 9/10

 International University, Ho Chi Minh City
Department of Mathematics

Figure 10

5 Conclusion
In conclusion, the Minimum Spanning Tree (MST) problem is a crucial concept in the field of graph theory
and network optimization. MST algorithms, like Prim’s and Kruskal’s, focus on the essential need of linking
every node in a network with the least possible total edge weight, and as a result, they provide effective and
useful solutions to several real-world issues. These issues are related to a variety of industries, such as data
clustering, electrical networks, transportation, and telecommunications.
Through the investigation of the MST issue and its applications, we have seen how the concepts of graph
theory may be leveraged to construct optimum and cost-effective networks. The hands-on activity illustrated
the methodical procedure for building an MST and underscored the need of choosing edges that preserve the
lowest possible cost while guaranteeing connection and preventing loops.
The MST problem improves our knowledge of theoretical graph ideas and offers useful tools for solving
challenging optimization problems across a range of sectors. The importance and applicability of the MST
issue are expected to grow as computing techniques and technology progress, hence reinforcing its fundamental
position in optimization and network design.

Spring Semester 2024 Page 10/10