|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4897
|
| タイトル: | The structure and number of global roundings of a graph |
| 著者: | Asano, Tetsuo
Katoh, Naoki
Tamaki, Hisao
Tokuyama, Takeshi |
| キーワード: | Combinatorics
Rounding
Discrepancy
Graph
Hypergraph |
| 発行日: | 2004-10-06 |
| 出版者: | Elsevier |
| 誌名: | Theoretical Computer Science |
| 巻: | 325 |
| 号: | 3 |
| 開始ページ: | 425 |
| 終了ページ: | 437 |
| DOI: | 10.1016/j.tcs.2004.02.044 |
| 抄録: | Given a connected weighted graph G=(V,E), we consider a hypergraph H_G=(V,P_G) corresponding to the set of all shortest paths in G. For a given real assignment a on V satisfying 0 ≤ -a(v) ≤ -1, a global rounding α with respect to H_G is a binary assignment satisfying that |∑_<v∈F>a(v)-α(v)|<1 for every F∈P_G. We conjecture that there are at most |V|+1 global roundings for H_G, and also the set of global roundings is an affine independent set. We give several positive evidences for the conjecture. |
| Rights: | NOTICE: This is the author’s version of a work accepted for publication by Elsevier.
Changes resulting from the publishing process, including peer review, editing, corrections,
structural formatting and other quality control mechanisms, may not be reflected in this
document. Changes may have been made to this work since it was submitted for publication.
A definitive version was subsequently published in Tetsuo Asano, Naoki Katoh, Hisao Tamaki and Takeshi Tokuyama, Theoretical Computer Science, 325(3), 2004, 425-437, http://dx.doi.org/10.1016/j.tcs.2004.02.044 |
| URI: | http://hdl.handle.net/10119/4897 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C4244.pdf | | 153Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
