On approximation of dominating tree in wireless sensor networks (Q1958639): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the tree and tour covers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximability of the independent/connected edge dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank

Latest revision as of 07:32, 3 July 2024

scientific article
Language Label Description Also known as
English
On approximation of dominating tree in wireless sensor networks
scientific article

    Statements