WEKO3
アイテム
Complexity of the Police Officer Patrol Problem
https://ipsj.ixsq.nii.ac.jp/records/217713
https://ipsj.ixsq.nii.ac.jp/records/217713a49e139e-faaf-4a5f-8cc9-2a64b420221a
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL6304011.pdf (3.6 MB)
|
Copyright (c) 2022 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2022-04-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Complexity of the Police Officer Patrol Problem | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Complexity of the Police Officer Patrol Problem | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [一般論文] edge routing problem, vertex cover problem, mixed graph, NP-complete | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Maebashi Institute of Technology | ||||||||||
| 著者所属 | ||||||||||
| Maebashi Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Maebashi Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Maebashi Institute of Technology | ||||||||||
| 著者名 |
Hiroaki, Tohyama
× Hiroaki, Tohyama
× Masaki, Tomisawa
|
|||||||||
| 著者名(英) |
Hiroaki, Tohyama
× Hiroaki, Tohyama
× Masaki, Tomisawa
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We introduce an edge routing decision problem called the police officer patrol problem (POPP), which is related to the vertex cover problem. A vertex cover of a graph can be regarded as the placement of police officers or fixed surveillance cameras so that each street of a neighborhood represented by the graph can be confirmed visually without moving from their position. In the edge routing problem we consider, a single police officer must confirm all the streets. The officer is allowed to move, but can confirm any street visually from an incident intersection without traversing it. In this paper, we show that the POPP on mixed graphs is NP-complete. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI http://dx.doi.org/10.2197/ipsjjip.30.307 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We introduce an edge routing decision problem called the police officer patrol problem (POPP), which is related to the vertex cover problem. A vertex cover of a graph can be regarded as the placement of police officers or fixed surveillance cameras so that each street of a neighborhood represented by the graph can be confirmed visually without moving from their position. In the edge routing problem we consider, a single police officer must confirm all the streets. The officer is allowed to move, but can confirm any street visually from an incident intersection without traversing it. In this paper, we show that the POPP on mixed graphs is NP-complete. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI http://dx.doi.org/10.2197/ipsjjip.30.307 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 63, 号 4, 発行日 2022-04-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
