Better approximability results for min-max tree/cycle/path cover problems (Q2420656)
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: Better approximability results for min-max tree/cycle/path cover problems |
scientific article; zbMATH DE number 7063562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better approximability results for min-max tree/cycle/path cover problems |
scientific article; zbMATH DE number 7063562 |
Statements
Better approximability results for min-max tree/cycle/path cover problems (English)
0 references
6 June 2019
0 references
approximation hardness
0 references
approximation algorithm
0 references
tree cover
0 references
cycle cover
0 references
path cover
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
0.9801619648933412
0 references
0.8655464053153992
0 references
0.8495296239852905
0 references
0.8446962237358093
0 references
0.8354095816612244
0 references
