Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/jgo/MinDJHHW06, #quickstatements; #temporary_batch_1731475607626
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation for minimum connected dominating sets / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jgo/MinDJHHW06 / rank
 
Normal rank

Revision as of 08:04, 13 November 2024

scientific article
Language Label Description Also known as
English
Improving construction for connected dominating set with Steiner tree in wireless sensor networks
scientific article

    Statements

    Identifiers