• Title/Summary/Keyword: Edge Minimum Spanning Tree

Search Result 18, Processing Time 0.02 seconds

Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem

  • Zhang, Xiang;Wang, Qina;Zhou, Jian
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.1
    • /
    • pp.9-15
    • /
    • 2013
  • An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

Mechanism for Building Approximation Edge Minimum Spanning Tree Using Portals on Input Edges (선분상의 포탈을 이용한 근사 선분 최소 신장 트리의 생성)

  • Kim, In-Bum;Kim, Soo-In
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.509-518
    • /
    • 2009
  • In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

Proposal of Minimum Spanning Tree Algorithm using 2-Edges Connected Grap (2-간선 연결 그래프를 사용한 최소신장트리 알고리즘 제안)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.233-241
    • /
    • 2014
  • This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

An Algorithm for Minimum Feedback Edge Set Problem (최소 되먹임 간선 집합 문제 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.3
    • /
    • pp.107-113
    • /
    • 2015
  • This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.

Note on the Inverse Metric Traveling Salesman Problem Against the Minimum Spanning Tree Algorithm

  • Chung, Yerim
    • Management Science and Financial Engineering
    • /
    • v.20 no.1
    • /
    • pp.17-19
    • /
    • 2014
  • In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

A New Tree Representation for Evolutionary Algorithms (진화 알고리듬을 위한 새로운 트리 표현 방법)

  • Soak, Sang-Moon;Ahn, Byung-Ha
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.1
    • /
    • pp.10-19
    • /
    • 2005
  • The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

Mechanism for Connecting Input Edges Using Steiner Tree (스타이너 트리를 이용한 입력 선분의 연결)

  • Kim, Joon-Mo;Kim, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.213-220
    • /
    • 2010
  • In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.

Use of Tree Traversal Algorithms for Chain Formation in the PEGASIS Data Gathering Protocol for Wireless Sensor Networks

  • Meghanathan, Natarajan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.6
    • /
    • pp.612-627
    • /
    • 2009
  • The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

A Degree-Constrained Minimum Spanning Tree Algorithm Using k-opt (k-opt를 적용한 차수 제약 최소신장트리 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.5
    • /
    • pp.31-39
    • /
    • 2015
  • The degree-constrained minimum spanning tree (d-MST) problem is considered NP-complete for no exact solution-yielding polynomial algorithm has been proposed to. One thus has to resort to an heuristic approximate algorithm to obtain an optimal solution to this problem. This paper therefore presents a polynomial time algorithm which obtains an intial solution to the d-MST with the help of Kruskal's algorithm and performs k-opt on the initial solution obtained so as to derive the final optimal solution. When tested on 4 graphs, the algorithm has successfully obtained the optimal solutions.

Minimum Spanning Tree Algorithm for Deletion of Maximum Weight Edge within a Cycle (한 사이클 내에서 최대 가중치 간선을 제거하기 위한 최소 신장트리 알고리즘)

  • Choi, Myeong-Bok;Han, Tae-Yong;Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.35-42
    • /
    • 2014
  • This paper suggests a method that obtains the minimum spanning tree (MST) far more easily and rapidly than the present ones. The suggested algorithm, firstly, simplifies a graph by means of reducing the number of edges of the graph. To achieve this, it applies a method of eliminating the maximum weight edge if the valency of vertices of the graph is equal to or more than 3. As a result of this step, we can obtain the reduced edge population. Next, it applies a method in which the maximum weight edge is eliminated within the cycle. On applying the suggested population minimizing and maximum weight edge deletion algorithms to 9 various graphs, as many as the number of cycles of the graph is executed and MST is easily obtained. It turns out to lessen 66% of the number of cycles and obtain the MST in at least 2 and at most 8 cycles by only deleting the maximum weight edges.