Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2258629489 / rank | |||
Normal rank | |||
Revision as of 00:04, 20 March 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
