A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528)
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: A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem |
scientific article; zbMATH DE number 6650481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem |
scientific article; zbMATH DE number 6650481 |
Statements
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (English)
0 references
10 November 2016
0 references
maximum distance-2 matching
0 references
optimization methods
0 references
grasp
0 references
branch and bound
0 references
parallel algorithms
0 references
wireless ad-hoc networks
0 references
capacity
0 references
0.8760147
0 references
0.8730747
0 references
0.87178856
0 references
0 references
0.8674303
0 references
0.8673735
0 references
0.86301535
0 references
