Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562)
From MaRDI portal
!
WARNING
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 6652742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of the \(k\)-arc Chinese postman problem |
scientific article; zbMATH DE number 6652742 |
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
0 references
1.0000002
0 references
0.9695784
0 references
0.8978187
0 references
0.8947695
0 references
0.8930488
0 references
0.8918746
0 references
0.88872755
0 references
0.8782421
0 references
0.87280434
0 references
0.87159777
0 references
