| Presentation | 2011-12-16 How to guard a graph against tree movements Takayoshi SAKAMAKI, Toshihiro FUJITO, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper shows that the optimization problem arising from the guarding game played between the cop and robber players on an undirected graph, can be approximated within a factor of Θ(log n) when the robber region is a tree. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Guarding game / Set cover / Greedy approximation |
| Paper # | COMP2011-40 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2011/12/9(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | How to guard a graph against tree movements |
| Sub Title (in English) | |
| Keyword(1) | Guarding game |
| Keyword(2) | Set cover |
| Keyword(3) | Greedy approximation |
| 1st Author's Name | Takayoshi SAKAMAKI |
| 1st Author's Affiliation | Department of Computer Science and Engineering, Toyohashi University of Technology() |
| 2nd Author's Name | Toshihiro FUJITO |
| 2nd Author's Affiliation | Department of Computer Science and Engineering, Toyohashi University of Technology |
| Date | 2011-12-16 |
| Paper # | COMP2011-40 |
| Volume (vol) | vol.111 |
| Number (no) | 360 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |