Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: M. Dambrine / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6652742 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
mixed Chinese postman problem | |||
| Property / zbMATH Keywords: mixed Chinese postman problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed parameter tractable | |||
| Property / zbMATH Keywords: fixed parameter tractable / rank | |||
Normal rank | |||
Revision as of 06:05, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of the \(k\)-arc Chinese postman problem |
scientific article |
Statements
Parameterized complexity of the \(k\)-arc Chinese postman problem (English)
0 references
14 November 2016
0 references
mixed Chinese postman problem
0 references
fixed parameter tractable
0 references
