An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability (Q752004): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5729634 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3207312 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random Minimal Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of the capacitated tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5526189 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subadditive Euclidean functionals and nonlinear growth in geometric probability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Growth rates of Euclidean minimal spanning trees with power weighted edges / rank | |||
Normal rank | |||
Revision as of 12:08, 21 June 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
