Parameterized Complexity of the k-Arc Chinese Postman Problem (Q2921440)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized Complexity of the k-Arc Chinese Postman Problem |
scientific article; zbMATH DE number 6352777
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized Complexity of the k-Arc Chinese Postman Problem |
scientific article; zbMATH DE number 6352777 |
Statements
Parameterized Complexity of the k-Arc Chinese Postman Problem (English)
0 references
8 October 2014
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
