WEKO3
アイテム
Drawing Borders Efficiently
http://hdl.handle.net/10228/0002000065
http://hdl.handle.net/10228/0002000065e0c6362d-c1f3-4cda-901f-3d4f49fb7e1c
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
10347412.pdf (177 KB)
|
|
| アイテムタイプ | 学術雑誌論文 = Journal Article(1) | |||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-08-18 | |||||||||||||||||
| 資源タイプ | ||||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||||
| 資源タイプ | journal article | |||||||||||||||||
| タイトル | ||||||||||||||||||
| タイトル | Drawing Borders Efficiently | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| 言語 | ||||||||||||||||||
| 言語 | eng | |||||||||||||||||
| 著者 |
Iwama, Kazuo
× Iwama, Kazuo
× 宮野, 英次
WEKO
6037
× Ono, Hirotaka
|
|||||||||||||||||
| 抄録 | ||||||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||||||
| 内容記述 | A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawing tables. Using spreadsheets, we often wish to draw several vertical and horizontal black lines on selective gridlines to enhance the readability of our spreadsheet. Such situations we frequently encounter are formulated as the Border Drawing Problem (BDP). Given a layout of black line segments, we study how to draw it efficiently from an algorithmic view point, by using a set of border styles and investigate its complexity. (i) We first define a formal model based on MS Excel, under which the drawability and the efficiency of border styles are discussed, and then (ii) show that unfortunately the problem is NP -hard for the set of the Excel border styles and for any reasonable subset of the styles. Moreover, in order to provide potentially more efficient drawing, (iii) we propose a new compact set of border styles and show a necessary and sufficient condition of its drawability. | |||||||||||||||||
| 書誌情報 |
en : Theory of Computing Systems 巻 44, 号 2, p. 230-244, 発行日 2008-05-29 |
|||||||||||||||||
| 出版社 | ||||||||||||||||||
| 出版者 | Springer | |||||||||||||||||
| DOI | ||||||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||||
| 関連識別子 | https://doi.org/10.1007/s00224-008-9117-y | |||||||||||||||||
| ISSN | ||||||||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||||||||
| 収録物識別子 | 1432-4350 | |||||||||||||||||
| ISSN | ||||||||||||||||||
| 収録物識別子タイプ | EISSN | |||||||||||||||||
| 収録物識別子 | 1433-0490 | |||||||||||||||||
| 著作権関連情報 | ||||||||||||||||||
| 権利情報 | This is a post-peer-review, pre-copyedit version of an article published in Theory of Computing Systems. The final authenticated version is available online at: https://doi.org/10.1007/s00224-008-9117-y | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | Algorithm | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | Combinatorial optimization | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | Spreadsheet | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | NP-hardness | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | Approximation algorithm | |||||||||||||||||
| 出版タイプ | ||||||||||||||||||
| 出版タイプ | AM | |||||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||||
| 査読の有無 | ||||||||||||||||||
| 値 | yes | |||||||||||||||||
| 研究者情報 | ||||||||||||||||||
| URL | https://hyokadb02.jimu.kyutech.ac.jp/html/233_ja.html | |||||||||||||||||
