Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems (Q2412434)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems |
scientific article |
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
