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

From MaRDI portal
Revision as of 11:30, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers