Better approximability results for min-max tree/cycle/path cover problems (Q2420656)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better approximability results for min-max tree/cycle/path cover problems |
scientific article |
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
