An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation for minimum connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving construction for connected dominating set with Steiner tree in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / rank
 
Normal rank

Revision as of 01:41, 4 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
scientific article

    Statements

    Identifiers