An average case analysis of the minimum spanning tree heuristic for the power assignment problem (Q5236925): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128812460, #quickstatements; #temporary_batch_1723487029957
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20831 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1832814332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation and minimal spanning forests in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for Euclidean minimal spanning trees on random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Range Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of power assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The central limit theorem for weighted minimal spanning trees on random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power consumption in packet radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity threshold for general uniform metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The central limit theorem for Euclidean minimal spanning trees. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest edge of the random minimal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laws of large numbers in stochastic geometry with statistical applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak laws of large numbers in geometric probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem and subadditive Euclidean functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of leaves of a euclidean minimal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for weighted minimal spanning trees on random points / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128812460 / rank
 
Normal rank

Latest revision as of 20:34, 12 August 2024

scientific article; zbMATH DE number 7118074
Language Label Description Also known as
English
An average case analysis of the minimum spanning tree heuristic for the power assignment problem
scientific article; zbMATH DE number 7118074

    Statements

    An average case analysis of the minimum spanning tree heuristic for the power assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    ad-hoc networks
    0 references
    analysis of algorithms
    0 references
    approximation algorithms
    0 references
    average case analysis
    0 references
    point processes
    0 references
    power assignment
    0 references
    range assignment
    0 references
    0 references
    0 references