|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4915
|
| タイトル: | Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs |
| 著者: | Uehara, Ryuhei
Chen, Zhi-Zhong |
| キーワード: | Graph algorithm
maximum weighted matching
approximation algorithm
parallel algorithm |
| 発行日: | 2000 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 1872 |
| 開始ページ: | 84 |
| 終了ページ: | 98 |
| DOI: | 10.1007/3-540-44929-9_7 |
| 抄録: | The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The first is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 - ε times the maximum for any given constant ε > 0. The second one is an NC approximation algorithm achieving an approximation ratio of 1/(2+ε) for any fixed ε > 0. The third and fourth algorithms only need to know the total order of weights, so they are useful when the edge weights require a large amount of memories to represent. The third one is an NC approximation algorithm that finds a matching of weight at least 2/(3Δ+2) times the maximum, where Δ is the maximum degree of the graph. The fourth one is an RNC algorithm that finds a matching of weight at least 1/(2Δ+4) times the maximum on average, and runs in Ο(log Δ) time, not depending on the size of the graph. |
| Rights: | This is the author-created version of Springer, Ryuhei Uehara and Zhi-Zhong Chen, Lecture Notes in Computer Science, 1872, 2000, 84-98. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/3-540-44929-9_7 |
| URI: | http://hdl.handle.net/10119/4915 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C3966.pdf | | 222Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
