Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (Q1652405)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs |
scientific article |
Statements
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (English)
0 references
11 July 2018
0 references
perfect matching problem
0 references
blossom algorithm
0 references
capacitated arc routing problem
0 references
rural postman problem
0 references
garbage collection
0 references
