• 제목/요약/키워드: Euclidean minimum spanning tree

검색결과 13건 처리시간 0.015초

Maximum Node Interconnection by a Given Sum of Euclidean Edge Lengths

  • Kim, Joonmo;Oh, Jaewon;Kim, Minkwon;Kim, Yeonsoo;Lee, Jeongeun;Han, Sohee;Hwang, Byungyeon
    • Journal of information and communication convergence engineering
    • /
    • 제17권4호
    • /
    • pp.246-254
    • /
    • 2019
  • This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

근사접근법 분석을 위한 오차허용치의 분배방법 (Sharing Error Allowances for the Analysis of Approximation Schemes)

  • 김준모;구은희
    • 대한전자공학회논문지TC
    • /
    • 제46권5호
    • /
    • pp.1-7
    • /
    • 2009
  • 센서네트워크를 포함한 다양한 모바일 네트워크를 구축하는 경우, 네트워크를 구성하는 단말 또는 노드들을 상호연결 하기 위한 배치 및 그래프를 찾아내는 문제가 대두된다. 이러한 문제를 해결 할 수 있는 공통적인 scheme을 제시하고, 이를 기반으로 구성되는 알고리즘의 실행시간 및 그 결과의 바운드를 수리적으로 정립하면, 관련 시스템 구축의 타당성을 정확하게 평가할 수 있게 된다. 본 논문은 이러한 문제를 대표하는 EMST(Euclidean Minimum Spanning Tree) 문제를 대상으로 하여 분산환경 기반에서 EMST를 병렬처리 형태로 구성할 수 있는 scheme을 제공하고, 이 scheme에 의해 구해 질 수 있는 배치 및 그래프가 EMST와 최대로 어느 정도의 차이를 가지게 되는 지를 판단할 수 있는 기준을 제시한다. 그리고 이 scheme에 의해 구성되는 알고리즘의 실행시간 상한을 제시한다.

수도권과 지방 주택매매가격의 동조화 변화 분석 (A Co-movement Analysis of Housing Purchase Price of Capital and Non-Capital Area)

  • 장한익
    • 토지주택연구
    • /
    • 제10권1호
    • /
    • pp.9-18
    • /
    • 2019
  • This study examined the dynamic change in the co-movement between the house price rates with the network methods of Mantegna (1999). First, Capital area and non-capital area form independent clusters which have the heterogeneous co-movement pattern. In other words, Capital and non-capital areas have low connectivity in the housing market. Also, if the co-movement between capital areas have been strengthened, the co-movement between non-capital areas have been weakened. The results of the dynamic analysis show that the degree of the co-movement in the housing market is continuously increased. The members of the co-movement group in the capital area are strongly steadied by all periods. However, the members in the non-capital area have been changed according to the period. Accordingly, it is necessary to establish policies based on various information for the housing market of the non-capital area rather than policies targeting the capital area. In addition, Apartments in Korea are more likely to be used as investment or speculative assets than other types of houses. It has been confirmed that this is Gangbuk, which is locatied in the northern part of Seoul, appears to be a region where the Spillover Effects of price fluctuation can be triggered in the housing and apartment market. However, the housing market in Gangnam, which is locatied in the southern part of Seoul, was divided into low systematic risk.