Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6057750 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-fold dominating set
Property / zbMATH Keywords: \(k\)-fold dominating set / rank
 
Normal rank
Property / zbMATH Keywords
 
slab decomposition
Property / zbMATH Keywords: slab decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
unit ball graph
Property / zbMATH Keywords: unit ball graph / rank
 
Normal rank

Revision as of 01:12, 30 June 2023

scientific article
Language Label Description Also known as
English
Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
scientific article

    Statements

    Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (English)
    0 references
    0 references
    0 references
    0 references
    17 July 2012
    0 references
    0 references
    \(k\)-fold dominating set
    0 references
    slab decomposition
    0 references
    algorithm
    0 references
    unit ball graph
    0 references