Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C47 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6655869 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vehicle routing | |||
| Property / zbMATH Keywords: vehicle routing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycle cover | |||
| Property / zbMATH Keywords: cycle cover / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
traveling salesman problem | |||
| Property / zbMATH Keywords: traveling salesman problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithm | |||
| Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
Revision as of 07:02, 28 June 2023
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
