Approximation algorithms for partition and design problems in networks

Notes on use

Search by Bookstore

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 博士論文
Title: Approximation algorithms for partition and design problems in networks
Author/Editor: Liang Zhao [著]
Author Heading: 趙, 亮チョウ, リョウ
Publication, Distribution, etc.: [Liang Zhao]
Publication Date: 2002
Publication Date (W3CDTF): 2002
Extent: 1冊
Alternative Title: ネットワーク分割と設計問題に対する近似アルゴリズムネットワークブンカツトセッケイモンダイニタイスルキンジアルゴリズム
Degree grantor/type: 京都大学
Date Granted: 平成14年3月25日
Date Granted (W3CDTF): 2002
Dissertation Number: 甲第9689号
Degree Type: 博士 (情報学)
Note (Dissertation): 博士論文
Place of Publication (Country Code): JP
Text Language Code: eng
Alias of Author: Zhao, Liang
NDLC: UT51
Note (General): 博士論文
Holding library: 国立国会図書館
Call No.: UT51-2002-G447
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 000003538175
http://id.ndl.go.jp/bib/000003538175
Bibliographic Record Category (NDL): 213