Proceedings of the Korean Information Science Society Conference (한국정보과학회:학술대회논문집)

  • 2006.10a
  • /
  • Pages.494-499
  • /
  • 2006
  • /
  • 1598-5164(pISSN)
Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Computing a Minimum-Dilation Spanning Tree is NP-hard

최소-Dilation 신장 트리 찾기의 NP-hard 증명

  • Cheong, Otfried (Dept. of Computer Science, Korea Advanced Institute of Science and Technology) ;
  • Haverkort, Herman (Department of Mathematics and Computing Science) ;
  • Lee, Mi-Ra (Dept. of Computer Science, Korea Advanced Institute of Science and Technology)
  • 정지원 (한국과학기술원 전산학과) ;
  • ;
  • 이미라 (한국과학기술원 전산학과)
  • Published : 2006.10.20
Download PDF
⟨ Previous Next ⟩

Abstract

Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation $\delta$ > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most $\delta$ exists.

Keywords