Browse

상수 개의 마디들을 연결하는 K 최소비용 스타이너 나무 문제에 대한 해법
Finding minimum K Steiner trees with constant number of required nodes

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
이수빈
Advisor
홍성필
Major
산업·조선공학부
Issue Date
2011-02
Publisher
서울대학교 대학원
Keywords
K 스타이너 나무 문제K 최소비용 스타이너 나무 문제K Steiner tree problem with r required nodesK Steiner tree problemK minimum Steiner tree problem
Description
학위논문 (석사)-- 서울대학교 대학원 : 산업·조선공학부, 2011.2. 홍성필.
Language
kor
URI
https://hdl.handle.net/10371/157824

http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000030105
Files in This Item:
There are no files associated with this item.
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Theses (Master's Degree_산업공학과)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse