Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2016.01.041 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2016.01.041 / rank | |||
Normal rank | |||
Latest revision as of 14:56, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for some min-max and minimum cycle cover problems |
scientific article |
Statements
Improved approximation algorithms for some min-max and minimum cycle cover problems (English)
0 references
24 November 2016
0 references
vehicle routing
0 references
cycle cover
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
0 references
0 references
0 references
