An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability (Q752004): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(90)90066-e / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986758236 / rank | |||
Normal rank | |||
Latest revision as of 10:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability |
scientific article |
Statements
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability (English)
0 references
1990
0 references
probabilistic analysis
0 references
minimum spanning tree
0 references
minimum matching
0 references
travelling salesman
0 references
Crofton's method
0 references
heuristics
0 references
asymptotics
0 references
