WEKO3
アイテム
Graph Orientation with Edge Modifications
http://hdl.handle.net/10228/0002000013
http://hdl.handle.net/10228/00020000132793f91c-22b3-4c9a-8b75-494bd103a85e
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
S012905412150012X.pdf (156 KB)
|
|
| Item type | 学術雑誌論文 = Journal Article(1) | |||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-07-31 | |||||||||||||||||||||
| 資源タイプ | ||||||||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||||||||
| 資源タイプ | journal article | |||||||||||||||||||||
| タイトル | ||||||||||||||||||||||
| タイトル | Graph Orientation with Edge Modifications | |||||||||||||||||||||
| 言語 | en | |||||||||||||||||||||
| 言語 | ||||||||||||||||||||||
| 言語 | eng | |||||||||||||||||||||
| 著者 |
Asahiro, Yuichi
× Asahiro, Yuichi
× Jansson, Jesper
× 宮野, 英次
WEKO
6037
× Ono, Hirotaka
× Sandhya, T. P.
|
|||||||||||||||||||||
| 抄録 | ||||||||||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||||||||||
| 内容記述 | The goal of an outdegree-constrained edge-modification problem is to find a spanning subgraph or supergraph H of an input undirected graph G such that either: (Type I) the number of edges in H is minimized or maximized and H can be oriented to satisfy some specified constraints on the vertices’ resulting outdegrees; or: (Type II) among all subgraphs or supergraphs of G that can be constructed by deleting or inserting a fixed number of edges, H admits an orientation optimizing some objective involving the vertices’ outdegrees. This paper introduces eight new outdegree-constrained edge-modification problems related to load balancing called (Type I) MIN-DEL-MAX, MIN-INS-MIN, MAX-INS-MAX, and MAX-DEL-MIN and (Type II)p -DEL-MAX, p -INS-MIN, p -INS-MAX, and p -DEL-MIN. In each of the eight problems, the input is a graph and the goal is to delete or insert edges so that the resulting graph has an orientation in which the maximum outdegree (taken over all vertices) is small or the minimum outdegree is large. We first present a framework that provides algorithms for solving all eight problems in polynomial time on unweighted graphs. Next we investigate the inapproximability of the edge-weighted versions of the problems, and design polynomial-time algorithms for six of the problems on edge-weighted trees. | |||||||||||||||||||||
| 書誌情報 |
en : International Journal of Foundations of Computer Science 巻 32, 号 02, p. 209-233, 発行日 2021-01-30 |
|||||||||||||||||||||
| 出版社 | ||||||||||||||||||||||
| 出版者 | World Scientific Publishing | |||||||||||||||||||||
| DOI | ||||||||||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||||||||
| 関連識別子 | https://doi.org/10.1142/S012905412150012X | |||||||||||||||||||||
| ISSN | ||||||||||||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||||||||||||
| 収録物識別子 | 0129-0541 | |||||||||||||||||||||
| ISSN | ||||||||||||||||||||||
| 収録物識別子タイプ | EISSN | |||||||||||||||||||||
| 収録物識別子 | 1793-6373 | |||||||||||||||||||||
| 著作権関連情報 | ||||||||||||||||||||||
| 権利情報 | Electronic version of an article published as International Journal of Foundations of Computer Science, VOL. 32, NO. 02, https://doi.org/10.1142/S012905412150012X. Copyright (c) copyright World Scientific Publishing Company, https://www.worldscientific.com/worldscinet/ijfcs | |||||||||||||||||||||
| キーワード | ||||||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||||||
| 主題 | Graph orientation | |||||||||||||||||||||
| キーワード | ||||||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||||||
| 主題 | maximum flow | |||||||||||||||||||||
| キーワード | ||||||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||||||
| 主題 | computational complexity | |||||||||||||||||||||
| キーワード | ||||||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||||||
| 主題 | inapproximability | |||||||||||||||||||||
| キーワード | ||||||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||||||
| 主題 | load balancing | |||||||||||||||||||||
| 出版タイプ | ||||||||||||||||||||||
| 出版タイプ | AM | |||||||||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||||||||
| 査読の有無 | ||||||||||||||||||||||
| 値 | yes | |||||||||||||||||||||
| 研究者情報 | ||||||||||||||||||||||
| URL | https://hyokadb02.jimu.kyutech.ac.jp/html/233_ja.html | |||||||||||||||||||||
