한국정보과학회:학술대회논문집 (Proceedings of the Korean Information Science Society Conference)
- 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (A)
- /
- Pages.494-499
- /
- 2006
- /
- 1598-5164(pISSN)
최소-Dilation 신장 트리 찾기의 NP-hard 증명
Computing a Minimum-Dilation Spanning Tree is 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)
- 발행 : 2006.10.20
초록
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
키워드