A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (Q4446911)

From MaRDI portal
Revision as of 01:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2037561
Language Label Description Also known as
English
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
scientific article; zbMATH DE number 2037561

    Statements

    A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2004
    0 references
    0 references
    connected dominating set
    0 references
    unit disk graph
    0 references
    polynomial-time approximation scheme
    0 references
    partition
    0 references
    0 references