WEKO3
アイテム
Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks
http://hdl.handle.net/10228/0002000019
http://hdl.handle.net/10228/0002000019799e589e-9d05-47c1-be69-8c73c22adf02
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 = Journal Article(1) | |||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2023-07-31 | |||||||||||||||||
資源タイプ | ||||||||||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||||
資源タイプ | journal article | |||||||||||||||||
タイトル | ||||||||||||||||||
タイトル | Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks | |||||||||||||||||
言語 | en | |||||||||||||||||
言語 | ||||||||||||||||||
言語 | eng | |||||||||||||||||
著者 |
Asahiro, Yuichi
× Asahiro, Yuichi
× 宮野, 英次
WEKO
6037
× Yagita, Tsuyoshi
|
|||||||||||||||||
抄録 | ||||||||||||||||||
内容記述タイプ | Abstract | |||||||||||||||||
内容記述 | In this paper we consider the following variant of clustering or laying out problems of graphs: Given a directed acyclic graph (DAG for short) and an integer B, the objective is to find a mapping of its nodes into blocks of size at most B that minimizes the maximum number of external arcs during traversals of the acyclic structure by following paths from the roots to the leaves. An external arc is defined as an arc connecting two distinct blocks. This paper focuses on the case B=2. Even if B=2 and the height of the DAG is three, it is known that the problem is NP-hard, and furthermore, there is no 3/2−ε factor approximation algorithm for B=2 and a small positive ε unless P = NP. On the other hand, the best approximation ratio previously shown is 3. In this paper we improve the approximation ratio into strictly smaller than 2. Also, we investigate the relationship between the height of input DAGs and the inapproximability, since the above inapproximability bound 32−ε is shown only for DAGs of height 3. | |||||||||||||||||
言語 | en | |||||||||||||||||
備考 | ||||||||||||||||||
内容記述タイプ | Other | |||||||||||||||||
内容記述 | 18th International Conference on Computational Science and Its Applications, ICCSA 2018, July 2 - 5, 2018, Melbourne, Australia | |||||||||||||||||
言語 | en | |||||||||||||||||
書誌情報 |
Lecture Notes in Computer Science 巻 10961, p. 607-623, 発行日 2018-07-04 |
|||||||||||||||||
出版社 | ||||||||||||||||||
出版者 | Springer | |||||||||||||||||
DOI | ||||||||||||||||||
識別子タイプ | DOI | |||||||||||||||||
関連識別子 | https://doi.org/10.1007/978-3-319-95165-2_43 | |||||||||||||||||
ISBN | ||||||||||||||||||
識別子タイプ | ISBN | |||||||||||||||||
関連識別子 | 978-3-319-95164-5 | |||||||||||||||||
ISBN | ||||||||||||||||||
識別子タイプ | ISBN | |||||||||||||||||
関連識別子 | 978-3-319-95165-2 | |||||||||||||||||
ISSN | ||||||||||||||||||
収録物識別子タイプ | EISSN | |||||||||||||||||
収録物識別子 | 1611-3349 | |||||||||||||||||
ISSN | ||||||||||||||||||
収録物識別子タイプ | PISSN | |||||||||||||||||
収録物識別子 | 0302-9743 | |||||||||||||||||
著作権関連情報 | ||||||||||||||||||
権利情報 | Copyright (c) 2018 Springer International Publishing AG, part of Springer Nature. This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: https://doi.org/10.1007/978-3-319-95165-2_43. | |||||||||||||||||
キーワード | ||||||||||||||||||
主題Scheme | Other | |||||||||||||||||
主題 | Directed Acyclic Graph (DAGs) | |||||||||||||||||
キーワード | ||||||||||||||||||
主題Scheme | Other | |||||||||||||||||
主題 | Input DAG | |||||||||||||||||
キーワード | ||||||||||||||||||
主題Scheme | Other | |||||||||||||||||
主題 | External Arc | |||||||||||||||||
キーワード | ||||||||||||||||||
主題Scheme | Other | |||||||||||||||||
主題 | Approximation Ratio | |||||||||||||||||
キーワード | ||||||||||||||||||
主題Scheme | Other | |||||||||||||||||
主題 | Inapproximability | |||||||||||||||||
出版タイプ | ||||||||||||||||||
出版タイプ | AM | |||||||||||||||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||||
査読の有無 | ||||||||||||||||||
値 | yes | |||||||||||||||||
研究者情報 | ||||||||||||||||||
URL | https://hyokadb02.jimu.kyutech.ac.jp/html/233_ja.html |