Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-016-1007-7 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-016-1007-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2290747859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless networking, dominating and packing / 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: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimum CDS with shortest path constraint in wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Einlagerung von Kreisen in einen konvexen Bereich / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for the fault-tolerant connected dominating set in a general graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-016-1007-7 / rank
 
Normal rank

Latest revision as of 14:34, 9 December 2024

scientific article
Language Label Description Also known as
English
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
scientific article

    Statements

    Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2016
    0 references
    dominating and absorbing set
    0 references
    strongly connected
    0 references
    virtual backbone
    0 references
    heterogeneous sensor networks
    0 references
    approximation algorithm
    0 references
    guaranteed performance
    0 references

    Identifiers