Parameterized complexity of \(k\)-Chinese postman problem (Q391983)
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 k-Chinese postman problem |
scientific article; zbMATH DE number 6244609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of \(k\)-Chinese postman problem |
scientific article; zbMATH DE number 6244609 |
Statements
Parameterized complexity of \(k\)-Chinese postman problem (English)
0 references
13 January 2014
0 references
fixed-parameter tractability
0 references
polynomial kernels
0 references
Chinese postman problem
0 references
0.8796464204788208
0 references
0.8791090250015259
0 references
0.8750149607658386
0 references
0.8511927723884583
0 references
0.8496876358985901
0 references
