Min-max cover of a graph with a small number of parts (Q1751107)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Min-max cover of a graph with a small number of parts |
scientific article; zbMATH DE number 6872048
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min-max cover of a graph with a small number of parts |
scientific article; zbMATH DE number 6872048 |
Statements
Min-max cover of a graph with a small number of parts (English)
0 references
24 May 2018
0 references
approximation algorithms
0 references
routing
0 references
vehicle routing problems
0 references
0 references
0 references
