- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
How to trim an MST: A 2-approximation algorithm for minimum cost tree cover
Bibliographic Information
- Other Title
-
- How to trim an MST A 2 approximation algorithm for minimum cost tree cover
- 最小コスト木状被覆問題の2倍近似アルゴリズム
Search this article
Journal
-
- 情報処理学会研究報告 = IPSJ SIG technical reports
-
情報処理学会研究報告 = IPSJ SIG technical reports 2006 (71), 13-20, 2006-07-03
東京 : 情報処理学会
- Tweet
Details 詳細情報について
-
- CRID
- 1520572359484322944
-
- NII Article ID
- 110004824078
-
- NII Book ID
- AN1009593X
-
- ISSN
- 09196072
-
- NDL BIB ID
- 8005528
-
- Text Lang
- en
-
- NDL Source Classification
-
- ZM13(科学技術--科学技術一般--データ処理・計算機)
-
- Data Source
-
- NDL Search
- CiNii Articles