Computational complexity of the police officer patrol problem on weighted digraphs (Q6669822)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7973510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the police officer patrol problem on weighted digraphs |
scientific article; zbMATH DE number 7973510 |
Statements
Computational complexity of the police officer patrol problem on weighted digraphs (English)
0 references
22 January 2025
0 references
edge traversing
0 references
police officer patrol problem
0 references
Chinese postman problem
0 references
vertex cover problem
0 references
NP-completeness
0 references
0.7033108472824097
0 references
0.7001728415489197
0 references
0.6950778365135193
0 references
0.6890285015106201
0 references
0.6871684193611145
0 references
