An efficient heuristic algorithm for minimum matching (Q3202140)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4179144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient heuristic algorithm for minimum matching |
scientific article; zbMATH DE number 4179144 |
Statements
An efficient heuristic algorithm for minimum matching (English)
0 references
1990
0 references
asymptotic behaviour
0 references
rate of convergence
0 references
heuristic
0 references
minimum matching
0 references
simulated annealing
0 references
0 references
0.8756199479103088
0 references
0.8347282409667969
0 references
0.8252202272415161
0 references
0.8222572803497314
0 references
0.8147746324539185
0 references
