A greedy approximation for minimum connected dominating sets (Q706637): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hongwei David Du / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Hua Jia / rank
Normal rank
 
Property / author
 
Property / author: Ker-I. Ko / rank
Normal rank
 
Property / author
 
Property / author: Hongwei David Du / rank
 
Normal rank
Property / author
 
Property / author: Xiao-Hua Jia / rank
 
Normal rank
Property / author
 
Property / author: Ker-I. Ko / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60402914 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.08.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987990114 / 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: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 17:55, 7 June 2024

scientific article
Language Label Description Also known as
English
A greedy approximation for minimum connected dominating sets
scientific article

    Statements

    A greedy approximation for minimum connected dominating sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 February 2005
    0 references
    Connected dominating set
    0 references
    greedy approximation
    0 references

    Identifiers