Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems (Q2412434)
From MaRDI portal
!
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 6796753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems |
scientific article; zbMATH DE number 6796753 |
Statements
Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems (English)
0 references
23 October 2017
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.9801619648933412
0 references
0.8790670037269592
0 references
0.8697599172592163
0 references
0.867927610874176
0 references
0.841548502445221
0 references
