Minimum cost partitions of trees with supply and demand (Theoretical foundations of computing)

Minimum cost partitions of trees with supply and demand

(Theoretical foundations of computing)

Journal name: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110(325) 2010.12.3

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

CiNii Research
Search Service
You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
Check the holdings of this book

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: Minimum cost partitions of trees with supply and demand
Author/Editor: 伊藤健洋
原拓哉
周暁他
Series Title: Theoretical foundations of computing
Author Heading: 伊藤健洋
原拓哉
周暁
Alternative Title: 需要点と供給点のある木のコスト最小分割
Periodical title: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue: 110(325) 2010.12.3
Volume: 110
Issue: 325
Pages: 37～44
Publication date of volume/issue (W3CDTF): 2010-12-03
ISSN (Periodical Title): 0913-5685
ISSN-L (Periodical Title): 0913-5685
Publication (Periodical Title): 東京 : 電子情報通信学会
Place of Publication (Country Code): JP
Text Language Code: eng
Subject Heading: 完全近似スキーム
木
近似アルゴリズム
供給点
グラフ分割
需要点
有向辺
approximation algorithm
demand vertex
directed edge
FPTAS
graph partition
supply vertex
tree
NDLC: ZN33
Target Audience: 一般
Report No. (Article): COMP2010-44
Holding library: 国立国会図書館
Call No.: Z16-940
Data Provider (Database): 国立国会図書館 : 国立国会図書館雑誌記事索引
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 10937664
http://id.ndl.go.jp/bib/10937664
Bibliographic Record Category (NDL): 632